Соңғы күй машинасы
Related Papers
Compiling and Using Finite-State Syntactic Rules
A language-independent framework for syntac- tic finlte-state parsing is discussed. The article presents a framework, a formalism, a compiler and a parser for grammars written in this for- realism. As …...
Two Parsing Algorithms by Means of Finite State Transducers
We present a new apl)roach , ilhlstrated by two algo- rithms> for parsing not only Finite SI.ate (:Iranlnlars but also Context Free Grainlnars and their extension, by means of finite …...
Finite-state Approximation of Constraint-based Grammars using Left-corner Grammar Transforms
This paper describes how to construct a finite-state machine (FSM) approximating a 'unification-based' grammar using a left-corner grammar transform. The approximation is presented as a series of gram- mar transforms, …...
Composition filtrée et marqueurs de règles de réécriture pour une distance d’édition flexible. Application à la correction des mots hors vocabulaire [Filtered Composition and Markers for a Flexible Edit-Distance. Application to the Correction of Out-Of-Vocabulary Words.]
. We present an original and flexible implementation of the edit-distance: the filtered composition, a special kind of composition of two finite-state machines through a filter that mod- els all …...
A Re-examination of Syntactic Complexity by Investigating the Internal Structure Variations of Adverbial Clauses across Speech and Writing
This paper re-examines the debatable issue about adverbial clause (A,CL) whether it in- dexes a complex discourse of contemporary English and how it distributes across Speech (S) and Writing (W) …...