Cookies on this website

We use cookies to ensure that we give you the best experience on our website. If you click 'Accept all cookies' we'll assume that you are happy to receive all cookies and you won't see this message again. If you click 'Reject all non-essential cookies' only necessary cookies providing core functionality such as security, network management, and accessibility will be enabled. Click 'Find out more' for information on how to change your cookie settings.

Semantic maps are a means of representing universal structure underlying semantic variation. However, no algorithm has existed for inferring a graphbased semantic map from cross-language data. Here, we note that this open problem is formally identical to the known problem of inferring a social network from disease outbreaks. From this identity it follows that semantic map inference is computationally intractable, but that an efficient approximation algorithm for it exists. We demonstrate that this algorithm produces sensible semantic maps from two existing bodies of data. We conclude that universal semantic graph structure can be automatically approximated from crosslanguage semantic data. © 2013, Walter de Gruyter Berlin Boston. All rights reserved.

Original publication

DOI

10.1515/lity-2013-0003

Type

Journal article

Journal

Linguistic Typology

Publication Date

01/01/2013

Volume

17

Pages

89 - 105