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

Direct link
Cite
Citation style
  • apa
  • 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
User-Defined Constructions in Unification-Based Formalisms
Linköping University, Department of Computer and Information Science. Linköping University, The Institute of Technology.
1996 (English)Doctoral thesis, monograph (Other academic)
Abstract [en]

Unification-based formalisms have been part of the state-of-the-art within linguistics and natural language processing for the past fifteen years. A number of such formalisms have been developed, all providing partially different constructions for representing linguistic knowledge. This development has been a benefit for the linguist and language engineer who want to develop a general natural language grammar, but the variety of formalisms makes it hard to find the most suitable formalism for a particular problem.

The goal of this thesis is to investigate the possibility of developing a platform for experimenting with different constructions within unification-based formalisms. To this end a meta-formalism, FLUF (FLexible Unification Formalism), has been created that allows the user to define his own constructions. This possibility is a further development of user-defined constructions as used in other formalisms.

While developing FLUF, the two properties of flexibility and predictability have been important as goals for the formalism. The property of flexibility allows the user to adjust the constructions within FLUF to the needs of his current problem while predictability concerns the computational behaviour and enables the user to adjust it to the current expressive power of the formalism.

The FLUF formalism consists mainly of three parts. The first part allows the user to define datatypes and functions on datatypes. This is similar to user-defined constructions in other formalisms, but here the user is allowed to affect the performance of the unification algorithm in several ways.The second part adds typing and inheritance to FLUF. Also here the main idea has been to provide variants of typing for the user to choose from. The last part, which allows for the definition of non-monotonic constructions, is a feature that is not provided in other formalisms.

The thesis concludes with a description of a pilot implementation of a tool based on FLUF and some possible applications where this tool can be used. This implementation suggests that it would be possible to build a future tool based on FLUF, provided predefined modules can be used to achieve better efficiency for the system.

Place, publisher, year, edition, pages
Linköping: Linköping University , 1996. , p. 204
Series
Linköping Studies in Science and Technology. Dissertations, ISSN 0345-7524 ; 461
National Category
Computer Systems
Identifiers
URN: urn:nbn:se:liu:diva-183016Libris ID: 7671788ISBN: 9178718570 (print)OAI: oai:DiVA.org:liu-183016DiVA, id: diva2:1639076
Public defence
1997-01-17, Belöningen, Hus B, Linköping, 13:15
Available from: 2022-02-18 Created: 2022-02-18 Last updated: 2022-02-18Bibliographically approved

Open Access in DiVA

No full text in DiVA

Authority records

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 Systems

Search outside of DiVA

GoogleGoogle Scholar

isbn
urn-nbn

Altmetric score

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

Direct link
Cite
Citation style
  • apa
  • 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