Zur Kurzanzeige

dc.contributor.authorBolshakov, Igor A.
dc.contributor.authorGelbukh, Alexander
dc.contributor.editorDüsterhöft, Antje
dc.contributor.editorThalheim, Bernhard
dc.date.accessioned2019-11-14T11:21:43Z
dc.date.available2019-11-14T11:21:43Z
dc.date.issued2003
dc.identifier.isbn3-88579-358-X
dc.identifier.issn1617-5468
dc.identifier.urihttp://dl.gi.de/handle/20.500.12116/29894
dc.description.abstractMalapropism is a (real-word) error in a text consisting in unintended replacement of one content word by another existing content word similar in sound but semantically incompatible with the context and thus destructing text cohesion, e.g.: they travel around the word. We present an algorithm of malapropism detection and correction based on evaluating the cohesion. As a measure of semantic compatibility of words we consider their ability to form syntactically linked and semantically admissible word combinations (collocations), e.g: travel (around the) world. With this, text cohesion at a content word is measured as the number of collocations it forms with the words in its immediate context. We detect malapropisms as words forming no collocations in the context. To test whether two words can form a collocation, we consider two types of resources: a collocation DB and an Internet search engine, e.g., Google. We illustrate the proposed method by classifying, tracing, and evaluating several English malapropisms.en
dc.language.isoen
dc.publisherGesellschaft für Informatik e.V.
dc.relation.ispartofNatural language processing and information systems
dc.relation.ispartofseriesLecture Notes in Informatics (LNI) - Proceedings, Volume P-29
dc.titleOn detection of malapropisms by multistage collocation testingen
dc.typeText/Conference Paper
dc.pubPlaceBonn
mci.reference.pages28-41
mci.conference.sessiontitleRegular Research Papers
mci.conference.locationBurg (Spreewald)
mci.conference.dateJune 2003


Dateien zu dieser Ressource

Thumbnail

Zur Kurzanzeige