Trending Bestseller

Polysemy

No reviews yet Write a Review
Polysemy is a term used in semantic and lexical analysis to describe a word with multiple meanings. The problem is to establish whether it's the same word with related meanings or different words that happen to look or sound the same. Such words present few difficulties in everyday language, but pose near-intractable problems for linguists and lexicographers. The contributors, including Anna Wierzbicka, Charles Fillmore, and James Pustejovsky, consider the implications of these problems for grammatical theory and how they may be addressed in computational linguistics.
Paperback / softback
01-December-2001
$117.24
Ships in 3-5 business days

Delivery estimate

Hurry up! Current stock:
Polysemy is a term used in semantic and lexical analysis to describe a word with multiple meanings. The problem is to establish whether it's the same word with related meanings or different words that happen to look or sound the same. Such words present few difficulties in everyday language, but pose near-intractable problems for linguists and lexicographers. The contributors, including Anna Wierzbicka, Charles Fillmore, and James Pustejovsky, consider the implications of these problems for grammatical theory and how they may be addressed in computational linguistics.
Product Details
ISBN-13
9780199250868
Publisher
Oxford University Press UK
Published
01-December-2001
Format
Paperback / softback

This product hasn't received any reviews yet. Be the first to review this product!

$117.24
Ships in 3-5 business days

Delivery estimate

Hurry up! Current stock:

Polysemy

$117.24

Description

Polysemy is a term used in semantic and lexical analysis to describe a word with multiple meanings. The problem is to establish whether it's the same word with related meanings or different words that happen to look or sound the same. Such words present few difficulties in everyday language, but pose near-intractable problems for linguists and lexicographers. The contributors, including Anna Wierzbicka, Charles Fillmore, and James Pustejovsky, consider the implications of these problems for grammatical theory and how they may be addressed in computational linguistics.