Content deleted Content added
LordOfPens (talk | contribs) m LordOfPens moved page Compound term processing to Compound-term processing: Missing hyphen in compound modifier |
Citation bot (talk | contribs) Alter: journal. Add: pages. Removed parameters. Formatted dashes. | You can use this bot yourself. Report bugs here. | Suggested by Headbomb | All pages linked from cached copy of Wikipedia:WikiProject_Academic_Journals/Journals_cited_by_Wikipedia/Sandbox | via #UCB_webform_linked 80/450 |
||
(5 intermediate revisions by 3 users not shown) | |||
Line 1:
'''Compound
Compound
== Techniques ==
In August 2003, [[Concept Searching Limited]] introduced the idea of using statistical
CLAMOUR is a European collaborative project which aims to find a better way to classify when collecting and disseminating industrial information and statistics. CLAMOUR appears to use a linguistic approach, rather than one based on [[statistical model|statistical modelling]].<ref>[http://webarchive.nationalarchives.gov.uk/20040117000117/statistics.gov.uk/methods_quality/clamour/default.asp] National Statistics CLAMOUR project</ref>
Line 11:
== History ==
Techniques for probabilistic weighting of single word terms date back to at least 1976 in the landmark publication by [[Stephen Robertson (computer scientist)|Stephen E. Robertson]] and [[Karen Spärck Jones]].<ref>{{Cite journal | doi = 10.1002/asi.4630270302| title = Relevance weighting of search terms| journal = Journal of the American Society for Information Science| volume = 27| issue = 3| pages = 129| year = 1976| last1 = Robertson | first1 = S. E. | authorlink1 = Stephen Robertson (computer scientist)| last2 = Spärck Jones | first2 = K. | authorlink2 = Karen Spärck Jones}}</ref> Robertson stated that the assumption of word independence is not justified and exists as a matter of mathematical convenience. His objection to the term independence is not a new idea, dating back to at least 1964 when H. H. Williams stated that "[t]he assumption of independence of words in a document is usually made as a matter of mathematical convenience".<ref>{{cite journal |last=WILLIAMS |first=J.H. |title=Results of classifying documents with multiple discriminant functions |url=http://oai.dtic.mil/oai/oai?verb=getRecord&metadataPrefix=html&identifier=AD0612272 |journal=
In 2004, Anna Lynn Patterson filed patents on "phrase-based searching in an information retrieval system"<ref>{{patent|US|20060031195}}</ref> to which [[Google]] subsequently acquired the rights.<ref>[http://www.seobythesea.com/2012/02/google-acquires-cuil-patent-applications/ Google Acquires Cuil Patent Applications]</ref>
Line 17:
== Adaptability ==
Statistical compound
Statistical compound
== Applications ==
Compound-term
Early search engines looked for documents containing the words entered by the user into the search box . These are known as [[keyword search]] engines. [[Boolean search]] engines add a degree of sophistication by allowing the user to specify additional requirements. For example, "Tiger NEAR Woods AND (golf OR golfing) NOT Volkswagen" uses the operators "NEAR", "AND", "OR" and "NOT" to specify that these words must follow certain requirements. A [[phrase search]] is simpler to use, but requires that the exact phrase specified appear in the results.
|