This paper describes a two-level formalism where feature structures are used in contextual rules. Whereas usual two-level grammars describe rational sets over symbol pairs, this new formalism uses tree structured regular expressions. They allow an explicit and precise definition of the scope of feature structures. A given surface form may be described using several feature structures. Feature unification is expressed in contextual rules using variables, like in a unification grammar. Grammars are compiled in finite state multi-tape transducers.
| Identifer | oai:union.ndltd.org:Potsdam/oai:kobv.de-opus-ubp:2712 |
| Date | January 2008 |
| Creators | Barthélemy, François |
| Publisher | Universität Potsdam, Extern. Extern |
| Source Sets | Potsdam University |
| Language | English |
| Detected Language | English |
| Type | InProceedings |
| Format | application/pdf |
| Rights | http://opus.kobv.de/ubp/doku/urheberrecht.php |
Page generated in 0.0015 seconds