Yliopiston etusivulle Suomeksi På svenska In English Helsingin yliopisto

An Efficient Constraint Grammar Parser based on Inward Deterministic Automata

Show full item record

Avaa tiedosto Vie RefWorksiin
Title: An Efficient Constraint Grammar Parser based on Inward Deterministic Automata
Author: Yli-Jyrä, Anssi Mikael
Citation: Yli-Jyrä , A M 2011 , ' An Efficient Constraint Grammar Parser based on Inward Deterministic Automata ' , in Proceedings of the NODALIDA 2011 Workshop Constraint Grammar Applications , pp. 50-60 NEALT Proceedings Series , vol. 14 (2011) .
Belongs to series: NEALT Proceedings Series
Belongs to series: Workshop in Constraint Grammar Applications in conjunction with NoDaLiDa 2011, Riga, Latvia - Proceedings of the NODALIDA 2011 Workshop Constraint Grammar Applications
Abstract: The paper reconceptualizes Constraint Grammar as a framework where the rules refine the compact representations of local ambiguity while the rule conditions are matched against a string of feature vectors that summarize the compact representations. Both views to the ambiguity are processed with pure finite-state operations. The compact representations are mapped to feature vectors with the aid of a rational power series. This magical interconnection is not less pure than a prevalent interpretation that requires that the reading set provided by a lexical transducer is magically linearized to a marked concatenation of readings given to pure transducers. The current approach has several practical benefits, including the inward deterministic way to compute, represent and maintain all the applications of the rules in the sentence.
Peer review status: Peer reviewed
URI: http://hdl.handle.net/10138/28875
Date: 2011-11-17

Files in this item

Files Description Size Format View/Open
yli_jyra.pdf 611.7Kb PDF View/Open
This item appears in the following Collection(s)

Show full item record

Search Helda


Advanced Search

Browse

My Account