{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/chatbot-for-admissions","title":"Chatbot for admissions","arxiv_id":"1408.6762","date":"2014-08-28","proceeding":null,"authors":["Nikolaos Polatidis"],"abstract":"The communication of potential students with a university department is\nperformed manually and it is a very time consuming procedure. The opportunity\nto communicate with on a one-to-one basis is highly valued. However with many\nhundreds of applications each year, one-to-one conversations are not feasible\nin most cases. The communication will require a member of academic staff to\nexpend several hours to find suitable answers and contact each student. It\nwould be useful to reduce his costs and time.\n  The project aims to reduce the burden on the head of admissions, and\npotentially other users, by developing a convincing chatbot. A suitable\nalgorithm must be devised to search through the set of data and find a\npotential answer. The program then replies to the user and provides a relevant\nweb link if the user is not satisfied by the answer. Furthermore a web\ninterface is provided for both users and an administrator.\n  The achievements of the project can be summarised as follows. To prepare the\nbackground of the project a literature review was undertaken, together with an\ninvestigation of existing tools, and consultation with the head of admissions.\nThe requirements of the system were established and a range of algorithms and\ntools were investigated, including keyword and template matching. An algorithm\nthat combines keyword matching with string similarity has been developed. A\nusable system using the proposed algorithm has been implemented. The system was\nevaluated by keeping logs of questions and answers and by feedback received by\npotential students that used it.","url_abs":"http://arxiv.org/abs/1408.6762v1","url_pdf":"http://arxiv.org/pdf/1408.6762v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"chatbot-for-admissions","repo_url":"https://github.com/ujjwal1599/Vanilla-Bot","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"chatbot","task_name":"Chatbot"},{"task_slug":"template-matching","task_name":"Template Matching"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"ujjwal1599/Vanilla-Bot","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"8810273a1f1b53da9e746c75926adab09bc3fc744e2536a0655f3e7ce965f63c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}