A set-theoretic approach to linguistic feature structures and unification algorithms (II)
The paper proposes formal inductive definitions for linguistic feature structures (FSs) taking values within a class of value types or sorts: single, disjunctive, (ordered) lists, multisets (or bags), po-multisets (multisets embedded into a partially ordered set), and indexed (re-entrance) values. T...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Vladimir Andrunachievici Institute of Mathematics and Computer Science
2001-02-01
|
| Series: | Computer Science Journal of Moldova |
| Online Access: | http://www.math.md/nrofdownloads.php?file=/files/csjm/v8-n3/v8-n3-(pp223-246).pdf |