liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Studies in extended unification-based formalism for linguistic description: an algorithm for feature structures with disjunction and a proposal for flexible systems
Linköping University, Department of Computer and Information Science. Linköping University, The Institute of Technology.
1992 (English)Licentiate thesis, monograph (Other academic)
Abstract [en]

Unification-based formalisms have been used in computational and traditional linguistics for quite some while. In these formalisms the feature structure is the basic structure for representing linguistic information. However, these structures often do not suffice for describing linguistic phenomena and various extensions to the basic structures have been proposed. These extensions constitute the subject of this thesis.

The thesis contains a survey of the extensions proposed in the literature. The survey is concluded by stating the properties that are most important if we want to build a system that can handle as many of the extensions as possible. These properties are expressiveness, flexibility, efficiency and predictability. The thesis also evaluates four existing formalisms with respect to these properties. On the basis of the evaluation we also suggest how to design a system handling multiple extensions where the main emphasis have been laid on getting a flexible system.

As the main result the thesis specifies an algorithm for unifying disjunctive feature structures. Unlike previous algorithms, except Eisele & Dörre (1990), this algorithm is as fast as an algorithm without disjunction when disjunctions do not participate in the unification, it is also as fast as an algorithm handling only local disjunctions when there are only local disjunctions, and expensive only in the case of unifying full disjunction. By this behaviour the algorithm shows one way to avoid the problem that high expressiveness also gives low efficiency. The description is given in the framework of graph unification algorithms which makes it easy to implement as an extension of such an algorithm

Place, publisher, year, edition, pages
Linköping: Univ. , 1992. , p. 80
Series
Linköping Studies in Science and Technology. Thesis, ISSN 0280-7971 ; 318
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:liu:diva-160725Local ID: LiU-Tek-Lic-1992:10ISBN: 91-7870-898-2 (print)OAI: oai:DiVA.org:liu-160725DiVA, id: diva2:1357737
Available from: 2019-10-04 Created: 2019-10-04 Last updated: 2019-10-04Bibliographically approved

Open Access in DiVA

No full text in DiVA

Authority records BETA

Strömbäck, Lena

Search in DiVA

By author/editor
Strömbäck, Lena
By organisation
Department of Computer and Information ScienceThe Institute of Technology
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 2 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf