Left-to-Right Parser for Tree-adjoining Grammar

Left-to-Right Parser for Tree-adjoining Grammar

A method and system for parsing a tree-adjoining grammar (TAG). A grammar parser reads in a sequence of tokens and determines if the sequence is valid in the grammar. It uses a matrix-vector representation of the TAG and performs parsing one token at a time. The innovation is the use of matrices and...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Huynh, Nen Van
Format: Patent
Sprache:eng
Schlagworte:
CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:A method and system for parsing a tree-adjoining grammar (TAG). A grammar parser reads in a sequence of tokens and determines if the sequence is valid in the grammar. It uses a matrix-vector representation of the TAG and performs parsing one token at a time. The innovation is the use of matrices and vectors to efficiently store the grammar and perform the parsing using these matrices and vectors.