{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T12:42:55Z","timestamp":1697978575163},"reference-count":9,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2006,10,30]],"date-time":"2006-10-30T00:00:00Z","timestamp":1162166400000},"content-version":"vor","delay-in-days":7242,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Softw Pract Exp"],"published-print":{"date-parts":[[1987,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p><jats:italic>Pathparse<\/jats:italic> is a tool with a practical approach to disambiguating problematic routes for services such as electronic mail. <jats:italic>Pathparse<\/jats:italic> resolves syntactic and host name ambiguities with the aid of a database that describes host connections. The parser generates a set of path\/user pairs; heuristics are used to select one among these, which may then be used by a conventional mail handler.<\/jats:p>","DOI":"10.1002\/spe.4380170106","type":"journal-article","created":{"date-parts":[[2006,11,18]],"date-time":"2006-11-18T04:39:43Z","timestamp":1163824783000},"page":"51-60","source":"Crossref","is-referenced-by-count":1,"title":["Parsing ambiguous addresses for electronic services"],"prefix":"10.1002","volume":"17","author":[{"given":"Peter","family":"Honeyman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patricia E.","family":"Parseghian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,30]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.17487\/rfc0822"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.17487\/rfc0886"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.17487\/rfc0819"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.17487\/rfc0882"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.17487\/rfc0883"},{"key":"e_1_2_1_7_2","doi-asserted-by":"crossref","unstructured":"J.PostelandJ.Reynolds \u2018Domain requirements\u2019 RFC\u2010920 USC Information Sciences Institute 1984.","DOI":"10.17487\/rfc0920"},{"key":"e_1_2_1_8_2","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"Papadimitriou C.","year":"1982"},{"key":"e_1_2_1_9_2","unstructured":"P.Honeyman D. L.Souvaine andM.Yannakakis \u2018A fast parser for ambiguous electronic addresses\u2019 manuscript in preparation."},{"key":"e_1_2_1_10_2","unstructured":"P.HoneymanandS. M.Bellovin \u2018PATHALIAS or the care and feeding of relative addresses\u2019 inProc. Summer USENIX Conf. Atlanta 1986 pp.126\u2013141."}],"container-title":["Software: Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fspe.4380170106","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/spe.4380170106","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T12:08:56Z","timestamp":1697890136000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/spe.4380170106"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,1]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1987,1]]}},"alternative-id":["10.1002\/spe.4380170106"],"URL":"https:\/\/doi.org\/10.1002\/spe.4380170106","archive":["Portico"],"relation":{},"ISSN":["0038-0644","1097-024X"],"issn-type":[{"value":"0038-0644","type":"print"},{"value":"1097-024X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,1]]}}}