Connection driven parsing of Lexicalized TAG
Identifieur interne : 00B766 ( Main/Merge ); précédent : 00B765; suivant : 00B767Connection driven parsing of Lexicalized TAG
Auteurs : Patrice LopezSource :
English descriptors
Abstract
This paper presents a new kind of algorithm for parsing lexicalized TAG. It proceeds considering connected anchors in order to eliminate hypotheses as soon as possible during the analysis. This algorithm proceeds bottum-up in a bidirectional fashion. It has been designed to be applied to natural language and grammars of important size and permits local parsing. Even if it does not improve the worst case time complexity of classical TAG parsers, it permits in practice an interesting efficiency on average case and an important flexibility.
Links toward previous steps (curation, corpus...)
- to stream Crin, to step Corpus: 002270
- to stream Crin, to step Curation: 002270
- to stream Crin, to step Checkpoint: 002293
Links to Exploration step
CRIN:lopez98dLe document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="339">Connection driven parsing of Lexicalized TAG</title>
</titleStmt>
<publicationStmt><idno type="RBID">CRIN:lopez98d</idno>
<date when="1998" year="1998">1998</date>
<idno type="wicri:Area/Crin/Corpus">002270</idno>
<idno type="wicri:Area/Crin/Curation">002270</idno>
<idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">002270</idno>
<idno type="wicri:Area/Crin/Checkpoint">002293</idno>
<idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Checkpoint">002293</idno>
<idno type="wicri:Area/Main/Merge">00B766</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">Connection driven parsing of Lexicalized TAG</title>
<author><name sortKey="Lopez, Patrice" sort="Lopez, Patrice" uniqKey="Lopez P" first="Patrice" last="Lopez">Patrice Lopez</name>
</author>
</analytic>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>LTAG</term>
<term>parsing</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en" wicri:score="2082">This paper presents a new kind of algorithm for parsing lexicalized TAG. It proceeds considering connected anchors in order to eliminate hypotheses as soon as possible during the analysis. This algorithm proceeds bottum-up in a bidirectional fashion. It has been designed to be applied to natural language and grammars of important size and permits local parsing. Even if it does not improve the worst case time complexity of classical TAG parsers, it permits in practice an interesting efficiency on average case and an important flexibility.</div>
</front>
</TEI>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Merge
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00B766 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 00B766 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Lorraine |area= InforLorV4 |flux= Main |étape= Merge |type= RBID |clé= CRIN:lopez98d |texte= Connection driven parsing of Lexicalized TAG }}
![]() | This area was generated with Dilib version V0.6.33. | ![]() |