File size: 164,400 Bytes
6fa4bc9 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732 1733 1734 1735 1736 1737 1738 1739 1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751 1752 1753 1754 1755 1756 1757 1758 1759 1760 1761 1762 1763 1764 1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787 1788 1789 1790 1791 1792 1793 1794 1795 1796 1797 1798 1799 1800 1801 1802 1803 1804 1805 1806 1807 1808 1809 1810 1811 1812 1813 1814 1815 1816 1817 1818 1819 1820 1821 1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 1835 1836 1837 1838 1839 1840 1841 1842 1843 1844 1845 1846 1847 1848 1849 1850 1851 1852 1853 1854 1855 1856 1857 1858 1859 1860 1861 1862 1863 1864 1865 1866 1867 1868 1869 1870 1871 1872 1873 1874 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893 1894 1895 1896 1897 1898 1899 1900 1901 1902 1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924 1925 1926 1927 1928 1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941 1942 1943 1944 1945 1946 1947 1948 1949 1950 1951 1952 1953 1954 1955 1956 1957 1958 1959 1960 1961 1962 1963 1964 1965 1966 1967 1968 1969 1970 1971 1972 1973 1974 1975 1976 1977 1978 1979 1980 1981 1982 1983 1984 1985 1986 1987 1988 1989 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 2021 2022 2023 2024 2025 2026 2027 2028 2029 2030 2031 2032 2033 2034 2035 2036 2037 2038 2039 2040 2041 2042 2043 2044 2045 2046 2047 2048 2049 2050 2051 2052 2053 2054 2055 2056 2057 2058 2059 2060 2061 2062 2063 2064 2065 2066 2067 2068 2069 2070 2071 2072 2073 2074 2075 2076 2077 2078 2079 2080 2081 2082 2083 2084 2085 2086 2087 2088 2089 2090 2091 2092 2093 2094 2095 2096 2097 2098 2099 2100 2101 2102 2103 2104 2105 2106 2107 2108 2109 2110 2111 2112 2113 2114 2115 2116 2117 2118 2119 2120 2121 2122 2123 2124 2125 2126 2127 2128 2129 2130 2131 2132 2133 2134 2135 2136 2137 2138 2139 2140 2141 2142 2143 2144 2145 2146 2147 2148 2149 2150 2151 2152 2153 2154 2155 2156 2157 2158 2159 2160 2161 2162 2163 2164 2165 2166 2167 2168 2169 2170 2171 2172 2173 2174 2175 2176 2177 2178 2179 2180 2181 2182 2183 2184 2185 2186 2187 2188 2189 2190 2191 2192 2193 2194 2195 2196 2197 2198 2199 2200 2201 2202 2203 2204 2205 2206 2207 2208 2209 2210 2211 2212 2213 2214 2215 2216 2217 2218 2219 2220 2221 2222 2223 2224 2225 2226 2227 2228 2229 2230 2231 2232 2233 2234 2235 2236 2237 2238 2239 2240 2241 2242 2243 2244 2245 2246 2247 2248 2249 2250 2251 2252 2253 2254 2255 2256 2257 2258 2259 2260 2261 2262 2263 2264 2265 2266 2267 2268 2269 2270 2271 2272 2273 2274 2275 2276 2277 2278 2279 2280 2281 2282 2283 2284 2285 2286 2287 2288 2289 2290 2291 2292 2293 2294 2295 2296 2297 2298 2299 2300 2301 2302 2303 2304 2305 2306 2307 2308 2309 2310 2311 2312 2313 2314 2315 2316 2317 2318 2319 2320 2321 2322 2323 2324 2325 2326 2327 2328 2329 2330 2331 2332 2333 2334 2335 2336 2337 2338 2339 2340 2341 2342 2343 2344 2345 2346 2347 2348 2349 2350 2351 2352 2353 2354 2355 2356 2357 2358 2359 2360 2361 2362 2363 2364 2365 2366 2367 2368 2369 2370 2371 2372 2373 2374 2375 2376 2377 2378 2379 2380 2381 2382 2383 2384 2385 2386 2387 2388 2389 2390 2391 2392 2393 2394 2395 2396 2397 2398 2399 2400 2401 2402 2403 2404 2405 2406 2407 2408 2409 2410 2411 2412 2413 2414 2415 2416 2417 2418 2419 2420 2421 2422 2423 2424 2425 2426 2427 2428 2429 2430 2431 2432 2433 2434 2435 2436 2437 2438 2439 2440 2441 2442 2443 2444 2445 2446 2447 2448 2449 2450 2451 2452 2453 2454 2455 2456 2457 2458 2459 2460 2461 2462 2463 2464 2465 2466 2467 2468 2469 2470 2471 2472 2473 2474 2475 2476 2477 2478 2479 2480 2481 2482 2483 2484 2485 2486 2487 2488 2489 2490 2491 2492 2493 2494 2495 2496 2497 2498 2499 2500 2501 2502 2503 2504 2505 2506 2507 2508 2509 2510 2511 2512 2513 2514 2515 2516 2517 2518 2519 2520 2521 2522 2523 2524 2525 2526 2527 2528 2529 2530 2531 2532 2533 2534 2535 2536 2537 2538 2539 2540 2541 2542 2543 2544 2545 2546 2547 2548 2549 2550 2551 2552 2553 2554 2555 2556 2557 2558 2559 2560 2561 2562 2563 2564 2565 2566 2567 2568 2569 2570 2571 2572 2573 2574 2575 2576 2577 2578 2579 2580 2581 2582 2583 2584 2585 2586 2587 2588 2589 2590 2591 2592 2593 2594 2595 2596 2597 2598 2599 2600 2601 2602 2603 2604 2605 2606 2607 2608 2609 2610 2611 2612 2613 2614 2615 2616 2617 2618 2619 2620 2621 2622 2623 2624 2625 2626 2627 2628 2629 2630 2631 2632 2633 2634 2635 2636 2637 2638 2639 2640 2641 2642 2643 2644 2645 2646 2647 2648 2649 2650 2651 2652 2653 2654 2655 2656 2657 2658 2659 2660 2661 2662 2663 2664 2665 2666 2667 2668 2669 2670 2671 2672 2673 2674 2675 2676 2677 2678 2679 2680 2681 2682 2683 2684 2685 2686 2687 2688 2689 2690 2691 2692 2693 2694 2695 2696 2697 2698 2699 2700 2701 2702 2703 2704 2705 2706 2707 2708 2709 2710 2711 2712 2713 2714 2715 2716 2717 2718 2719 2720 2721 2722 2723 2724 2725 2726 2727 2728 2729 2730 2731 2732 2733 2734 2735 2736 2737 2738 2739 2740 2741 2742 2743 2744 2745 2746 2747 2748 2749 2750 2751 2752 2753 2754 2755 2756 2757 2758 2759 2760 2761 2762 2763 2764 2765 2766 2767 2768 2769 2770 2771 2772 2773 2774 2775 2776 2777 2778 2779 2780 2781 2782 2783 2784 2785 2786 2787 2788 2789 2790 2791 2792 2793 2794 2795 2796 2797 2798 2799 2800 2801 2802 2803 2804 2805 2806 2807 2808 2809 2810 2811 2812 2813 2814 2815 2816 2817 2818 2819 2820 2821 2822 2823 2824 2825 2826 2827 2828 2829 2830 2831 2832 2833 2834 2835 2836 2837 2838 2839 2840 2841 2842 2843 2844 2845 2846 2847 2848 2849 2850 2851 2852 2853 2854 2855 2856 2857 2858 2859 2860 2861 2862 2863 2864 2865 2866 2867 2868 2869 | {
"paper_id": "O13-2003",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T08:03:45.848884Z"
},
"title": "Machine Translation Approaches and Survey for Indian Languages",
"authors": [],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "The term Machine Translation is a standard name for computerized systems responsible for the production of translations from one natural language into another with or without human assistance. It is a sub-field of computational linguistics that investigates the use of computer software to translate text or speech from one natural language to another. Many attempts are being made all over the world to develop machine translation systems for various languages using rule-based as well as statistically based approaches. Development of a full-fledged bilingual machine translation (MT) system for any two natural languages with limited electronic resources and tools is a challenging and demanding task. In order to achieve reasonable translation quality in open source tasks, corpus based machine translation approaches require large amounts of parallel corpora that are not always available, especially for less resourced language pairs. On the other hand, the rule-based machine translation process is extremely time consuming, difficult, and fails to analyze accurately a large corpus of unrestricted text. Even though there has been effort towards building English to Indian language and Indian language to Indian language translation system, unfortunately, we do not have an efficient translation system as of today. The literature shows that there have been many attempts in MT for English to Indian languages and Indian languages to Indian languages. At present, a number of government and private sector projects are working towards developing a full-fledged MT for Indian languages. This paper gives a brief description of the various approaches and major machine translation developments in India.",
"pdf_parse": {
"paper_id": "O13-2003",
"_pdf_hash": "",
"abstract": [
{
"text": "The term Machine Translation is a standard name for computerized systems responsible for the production of translations from one natural language into another with or without human assistance. It is a sub-field of computational linguistics that investigates the use of computer software to translate text or speech from one natural language to another. Many attempts are being made all over the world to develop machine translation systems for various languages using rule-based as well as statistically based approaches. Development of a full-fledged bilingual machine translation (MT) system for any two natural languages with limited electronic resources and tools is a challenging and demanding task. In order to achieve reasonable translation quality in open source tasks, corpus based machine translation approaches require large amounts of parallel corpora that are not always available, especially for less resourced language pairs. On the other hand, the rule-based machine translation process is extremely time consuming, difficult, and fails to analyze accurately a large corpus of unrestricted text. Even though there has been effort towards building English to Indian language and Indian language to Indian language translation system, unfortunately, we do not have an efficient translation system as of today. The literature shows that there have been many attempts in MT for English to Indian languages and Indian languages to Indian languages. At present, a number of government and private sector projects are working towards developing a full-fledged MT for Indian languages. This paper gives a brief description of the various approaches and major machine translation developments in India.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "MT refers to the use of computers to automate some of the tasks or the entire task of translating between human languages. Development of a full-fledged bilingual MT system for any two natural languages with limited electronic resources and tools is a challenging and demanding task. Many attempts are being made all over the world to develop MT systems for various languages using rule-based as well as statistical-based approaches. MT systems can be designed either specifically for two particular languages, called a bilingual system, or for more than a single pair of languages, called a multilingual system. A bilingual system may be either unidirectional, from one Source Language (SL) into one Target Language (TL), or may be bidirectional. Multilingual systems are usually designed to be bidirectional, but most bilingual systems are unidirectional. MT methodologies are commonly categorized as direct, transfer, and Interlingua. The methodologies differ in the depth of analysis of the SL and the extent to which they attempt to reach a language independent representation of meaning or intent between the source and target languages. Barriers in good quality MT output can be attributed to ambiguity in natural languages. Ambiguity can be classified into two types: structural ambiguity and lexical ambiguity.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1."
},
{
"text": "India is a linguistically rich area. It has 18 constitutional languages, which are written in 10 different scripts. Hindi is the official language of the Union. Many of the states have their own regional language, which is either Hindi or one of the other constitutional languages. In addition, English is very widely used for media, commerce, science and technology, and education only about 5% of the world's population speaks English as a first language. In such a situation, there is a large market for translation between English and the various Indian languages.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1."
},
{
"text": "Even though MT in India started more than two decades ago, it is still an ongoing process. The third section of this paper discusses various approaches used in English to Indian languages and Indian language to Indian language MT systems. The fourth section gives a brief explanation of different MT attempts for English to Indian languages and Indian languages to Indian languages. to the Apertium system, using a bilingual dictionary and a three-staged process, i.e. first a native speaking human editor of the SL (SL) pre-processed the text, then the machine performed the translation, and finally a native-speaking human editor of the TL post-edited the text (Hutchins et al., 1993; Hutchins et al., 2000) .",
"cite_spans": [
{
"start": 663,
"end": 686,
"text": "(Hutchins et al., 1993;",
"ref_id": "BIBREF16"
},
{
"start": 687,
"end": 709,
"text": "Hutchins et al., 2000)",
"ref_id": "BIBREF18"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1."
},
{
"text": "After the birth of computers Electrical Numerical Integrator and Calculator (ENIAC) in 1947, research began on using computers as aids for translating natural languages (Hutchins et al., 2005) . The first public demonstration of MT in the Georgetown-IBM experiment, which proved deceptively promising, encouraged financing of further research in the field. In 1949, Weaver wrote a memorandum, putting forward various proposals (based on the wartime successes in code breaking) on the developments in information theory and speculation about universal principles underlying natural languages (Weaver et al., 1999) . In the decade of optimism, from 1954-1966 , researchers encountered many predictions of imminent 'breakthroughs'. In 1966, the Automated Language Processing Advisory Committee (ALPAC) report was submitted, which said that, for 'semantic barriers', there are no straightforward solutions. The ALPAC report committee could not find any \"pressing need for MT\" nor \"an unfulfilled need for translation (ALPAC et al., 1996) \". This report brought MT research to its knees, suspending virtually all research in the United States of America (USA) while some research continued in Canada, France, and Germany (Hutchins et al., 2005) . After the ALPAC report, MT almost was ignored from 1966-1980. In the year 1988, Georgetown-IBM experiment launched \"IBM CANDIDE System,\" where over 60 Russian sentences were translated smoothly into English using 6 rules and a bilingual dictionary consisting of 250 Russian words, with rule-signs assigned to words with more than one meaning. Although Professor Leon Dostert cautioned that this experimental demonstration was only a scientific sample, or \"a Kitty Hawk of electronic translation (Kitty Hawk 1 ),\" a wide variety of MT systems emerged after 1980 from various countries and research continued on more advanced methods and techniques. Those systems mostly were comprised of indirect translations or used an 'interlingua' as an intermediary. In the 1990s, Statistical Machine Translation (SMT) and what is now known as Example-based Machine Translation (EBMT) saw the light of day (IBM, 1954) . At this time the focus of MT began to shift somewhat from pure research to practical application using a hybrid approach. Moving towards the change of the millennium, MT became more readily available to individuals via online services and software for their personal computers.",
"cite_spans": [
{
"start": 169,
"end": 192,
"text": "(Hutchins et al., 2005)",
"ref_id": "BIBREF17"
},
{
"start": 591,
"end": 612,
"text": "(Weaver et al., 1999)",
"ref_id": "BIBREF41"
},
{
"start": 632,
"end": 656,
"text": "optimism, from 1954-1966",
"ref_id": null
},
{
"start": 1013,
"end": 1033,
"text": "(ALPAC et al., 1996)",
"ref_id": null
},
{
"start": 1216,
"end": 1239,
"text": "(Hutchins et al., 2005)",
"ref_id": "BIBREF17"
},
{
"start": 2135,
"end": 2146,
"text": "(IBM, 1954)",
"ref_id": "BIBREF19"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1."
},
{
"text": "Generally, MT is classified into seven broad categories: rule-based, statistical-based, hybrid-based, example-based, knowledge-based, principle-based, and online interactive based methods. The first three MT approaches are the most widely used and earliest methods. Literature shows that there have been fruitful attempts using all these approaches for the development of English to Indian languages as well as Indian languages to Indian languages. At present, most of the MT related research is based on statistical and example-based approaches. ",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "MT Approaches",
"sec_num": "3."
},
{
"text": "In the field of MT, the rule-based approach is the first strategy that was developed. A Rule-Based Machine Translation (RBMT) system consists of collection of rules, called grammar rules, a bilingual or multilingual lexicon, and software programs to process the rules.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Rule-based Approach",
"sec_num": "3.1"
},
{
"text": "Nevertheless, building RBMT systems entails a huge human effort to code all of the linguistic resources, such as source side part-of-speech taggers and syntactic parsers, bilingual dictionaries, source to target transliteration, TL morphological generator, structural transfer, and reordering rules. Nevertheless, a RBMT system always is extensible and maintainable. Rules play a major role in various stages of translation, such as syntactic processing, semantic interpretation, and contextual processing of language. Generally, rules are written with linguistic knowledge gathered from linguists. Transfer-based MT, Interlingua MT, and dictionary-based MT are the three different approaches that come under the RBMT category. In the case of English to Indian languages and Indian language to Indian language MT systems, there have been fruitful attempts with all four approaches. The main idea behind these rule-based approaches is as follows.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Rule-based Approach",
"sec_num": "3.1"
},
{
"text": "In the direct translation method, the SL text is analysed structurally up to the morphological level and is designed for a specific source and target language pair (Noone et al., 2003; . The performance of a direct MT system depends on the quality and quantity of the source-target language dictionaries, morphological analysis, text processing software, and word-by-word translation with minor grammatical adjustments on word order and morphology.",
"cite_spans": [
{
"start": 164,
"end": 184,
"text": "(Noone et al., 2003;",
"ref_id": "BIBREF28"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Direct Translation",
"sec_num": "3.1.1"
},
{
"text": "The next stage of progress in the development of MT systems is the Interlingua approach, where translation is performed by first representing the SL text into an intermediary (semantic) form called Interlingua. The advantage of this approach is that Interlingua is a language independent representation from which translations can be generated to different TLs. Thus, the translation consists of two stages, where the SL is first converted in to the Interlingua (IL) form before translation from the IL to the TL. The main advantage of this Interlingua approach is that the analyzer of the parser for the SL is independent of the generator for the TL. There are two main drawbacks in the Interlingua approach. The first disadvantage is, difficulty in defining the interlingua. The second disadvantage is Interlingua does not take the advantage of similarities between languages, such as translation between Dravidian languages. Nevertheless the advantage of Interlingua is it is economical in situations where translation among multiple languages is involved (Shachi et al., 2001 ).",
"cite_spans": [
{
"start": 1059,
"end": 1079,
"text": "(Shachi et al., 2001",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Interlingua Based Translation",
"sec_num": "3.1.2"
},
{
"text": "Starting with the shallowest level at the bottom, direct transfer is made at the word level. Moving upward through syntactic and semantic transfer approaches, the translation occurs on representations of the source sentence structure and meaning, respectively. Finally, at the interlingual level, the notion of transfer is replaced with a single underlying representation called the 'Interlingua'. 'Interlingua' represents both the source and target texts simultaneously. Moving up the triangle reduces the amount of work required to traverse the gap between languages at the cost of increasing the required amount of analysis and synthesis.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Interlingua Based Translation",
"sec_num": "3.1.2"
},
{
"text": "Because of the disadvantage of the Interlingua approach, a better rule-based translation approach was discovered, called the transfer approach. Recently, many research groups have being using this third approach for their MT system, both abroad and in India. On the basis of the structural differences between the source and target language, a transfer system can be broken down into three different stages: i) Analysis, ii) Transfer and iii) Generation. In the first stage, the SL parser is used to produce the syntactic representation of a SL sentence. In the next stage, the result of the first stage is converted into equivalent TL-oriented representations. In the final step of this translation approach, a TL morphological analyzer is used to generate the final TL texts.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Transfer Based Translation",
"sec_num": "3.1.3"
},
{
"text": "The statistical approach comes under Empirical Machine Translation (EMT) systems, which rely on large parallel aligned corpora. Statistical machine translation is a data-oriented statistical framework for translating text from one natural language to another based on the knowledge and statistical models extracted from bilingual corpora. In statistical-based MT, bilingual or multilingual textual corpora of the source and target language or languages are required. A supervised or unsupervised statistical machine learning algorithm is used to build statistical tables from the corpora, and this process is called the learning or training (Zhang et al., 2006) . The statistical tables consist of statistical information, such as the characteristics of well-formed sentences, and the correlation between the languages. During translation, the collected statistical information is used to find the best translation for the input sentences, and this translation step is called the decoding process. There are three different statistical approaches in MT, Word-based Translation, Phrase-based Translation, and Hierarchical phrase based model. The idea behind SMT comes from information theory. A document is translated according to the probability distribution function indicated by p(e|f), which is the Probability of translating a sentence f in the SL F (for example, English) to a sentence e in the TL E (for example, Kannada).",
"cite_spans": [
{
"start": 641,
"end": 661,
"text": "(Zhang et al., 2006)",
"ref_id": "BIBREF43"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Statistical-based Approach",
"sec_num": "3.2"
},
{
"text": "The problem of modeling the probability distribution p(e|f) has been approached in a number of ways. One intuitive approach is to apply Bayes theorem. That is, if p(f|e) and p(e) indicate translation model and language model, respectively, then the probability distribution p(e|f) \u221e p(f|e)p(e). The translation model p(f|e) is the probability that the source sentence is the translation of the target sentence or the way sentences in E get converted to sentences in F. The language model p(e) is the probability of seeing that TL string or the kind of sentences that are likely in the language E. This decomposition is attractive as it splits the problem into two sub problems. Finding the best translation \u0303 is done by picking the one that gives the highest probability, as shown in Equation 1. ",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Statistical-based Approach",
"sec_num": "3.2"
},
{
"text": "Even though phrase based models have emerged as the most successful method for SMT, they do not handle syntax in a natural way. Reordering of phrases during translation is typically managed by distortion models in SMT. Nevertheless, this reordering process is entirely unsatisfactory, especially for language pairs that differ a lot in terms of word-order. In the proposed project, the problem of structural differences between source and target languages is overcome successfully with a reordering task. We have also proven that, with the use of morphological information, especially for a morphologically rich language like Kannada, the training data size can be reduced considerably with an improvement in performance.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Statistical-based Approach",
"sec_num": "3.2"
},
{
"text": "As the name suggests, the words in an input sentence are translated word by word individually, and these words finally are arranged in a specific way to get the target sentence. The alignment between the words in the input and output sentences normally follows certain patterns in word based translation. This approach is the very first attempt in the statistical-based MT system that is comparatively simple and efficient. The main disadvantage of this system is the oversimplified word by word translation of sentences, which may reduce the performance of the translation system.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Word Based Translation",
"sec_num": "3.2.1"
},
{
"text": "A more accurate SMT approach, called phrase-based translation (Koehn et al., 2003) , was introduced, where each source and target sentence is divided into separate phrases instead of words before translation. The alignment between the phrases in the input and output sentences normally follows certain patterns, which is very similar to word based translation. Even though the phrase based models result in better performance than the word based translation, they did not improve the model of sentence order patterns. The alignment model is based on flat reordering patterns, and experiments show that this reordering technique may perform Machine Translation Approaches and Survey for Indian Languages 55 well with local phrase orders but not as well with long sentences and complex orders.",
"cite_spans": [
{
"start": 62,
"end": 82,
"text": "(Koehn et al., 2003)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Phrase Based Translation",
"sec_num": "3.2.2"
},
{
"text": "By considering the drawback of previous two methods, Chiang (2005) developed a more sophisticated SMT approach, called the hierarchical phrase based model. The advantage of this approach is that hierarchical phrases have recursive structures instead of simple phrases. This higher level of abstraction approach further improved the accuracy of the SMT system.",
"cite_spans": [
{
"start": 53,
"end": 66,
"text": "Chiang (2005)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Hierarchical Phrase Based model",
"sec_num": "3.2.3"
},
{
"text": "By taking the advantage of both statistical and rule-based translation methodologies, a new approach was developed, called hybrid-based approach, which has proven to have better efficiency in the area of MT systems. At present, several governmental and private based MT sectors use this hybrid-based approach to develop translation from source to target language, which is based on both rules and statistics. The hybrid approach can be used in a number of different ways. In some cases, translations are performed in the first stage using a rule-based approach followed by adjusting or correcting the output using statistical information. In the other way, rules are used to pre-process the input data as well as post-process the statistical output of a statistical-based translation system. This technique is better than the previous and has more power, flexibility, and control in translation.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Hybrid-based Translation",
"sec_num": "3.3"
},
{
"text": "Hybrid approaches integrating more than one MT paradigm are receiving increasing attention. The METIS-II MT system is an example of hybridization around the EBMT framework; it avoids the usual need for parallel corpora by using a bilingual dictionary (similar to that found in most RBMT systems) and a monolingual corpus in the TL (Dirix et al., 2005) . An example of hybridization around the rule-based paradigm is given by Oepen. It integrates statistical methods within an RBMT system to choose the best translation from a set of competing hypotheses (translations) generated using rule-based methods (Oepen et al., 2007) .",
"cite_spans": [
{
"start": 331,
"end": 351,
"text": "(Dirix et al., 2005)",
"ref_id": "BIBREF10"
},
{
"start": 604,
"end": 624,
"text": "(Oepen et al., 2007)",
"ref_id": "BIBREF29"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Hybrid-based Translation",
"sec_num": "3.3"
},
{
"text": "In SMT, Koehn and Hoang integrate additional annotations at the word-level into the translation models in order to better learn some aspects of the translation that are best explained on a morphological, syntactic, or semantic level (Koehn et al., 2007) . Hybridization around the statistical approach to MT is provided by Groves and Way; they combine both corpus-based methods into a single MT system by incorporating phrases (sub-sentential chunks) from both EBMT and SMT into an SMT system (Groves et al., 2005) . A different hybridization happens when an RBMT system and an SMT system are used in a cascade; Simard proposed an approach, analogous to that by Dugast, using an SMT system as an automatic post-editor of the translations produced by an RBMT system (Simard et al., 2007) (Dugast et al., 2007) .",
"cite_spans": [
{
"start": 233,
"end": 253,
"text": "(Koehn et al., 2007)",
"ref_id": "BIBREF22"
},
{
"start": 493,
"end": 514,
"text": "(Groves et al., 2005)",
"ref_id": "BIBREF14"
},
{
"start": 765,
"end": 786,
"text": "(Simard et al., 2007)",
"ref_id": "BIBREF35"
},
{
"start": 787,
"end": 808,
"text": "(Dugast et al., 2007)",
"ref_id": "BIBREF11"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Hybrid-based Translation",
"sec_num": "3.3"
},
{
"text": "The example-based translation approach is based on analogical reasoning between two translation examples, proposed by Makoto Nagao in 1984. At run time, an example-based translation is characterized by its use of a bilingual corpus as its main knowledge base. The example-based approach comes under the EMT system, which relies on large parallel aligned corpora.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Example-based translation",
"sec_num": "3.4"
},
{
"text": "Example-based translation is essentially translation by analogy. An EBMT system is given a set of sentences in the SL (from which one is translating) and their corresponding translations in the TL, and uses those examples to translate other, similar source-language sentences into the TL. The basic premise is that, if a previously translated sentence occurs again, the same translation is likely to be correct again. EBMT systems are attractive in that they require a minimum of prior knowledge; therefore, they are quickly adaptable to many language pairs.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Example-based translation",
"sec_num": "3.4"
},
{
"text": "A restricted form of example-based translation is available commercially, known as a translation memory. In a translation memory, as the user translates text, the translations are added to a database, and when the same sentence occurs again, the previous translation is inserted into the translated document. This saves the user the effort of re-translating that sentence, and is particularly effective when translating a new revision of a previously-translated document.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Example-based translation",
"sec_num": "3.4"
},
{
"text": "More advanced translation memory systems will also return close but inexact matches on the assumption that editing the translation of the close match will take less time than generating a translation from scratch. ALEPH, wEBMT, English to Turkish, English to Japanese, English to Sanskrit, and PanEBMT are some of the example-based MT systems.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Example-based translation",
"sec_num": "3.4"
},
{
"text": "Knowledge-Based Machine Translation (KBMT) is characterized by a heavy emphasis on functionally complete understanding of the source text prior to the translation into the target text. KBMT does not require total understanding, but assumes that an interpretation engine can achieve successful translation into several languages. KBMT is implemented on the Interlingua architecture; it differs from other interlingual techniques by the depth with which it analyzes the SL and its reliance on explicit knowledge of the world.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Knowledge-Based MT",
"sec_num": "3.5"
},
{
"text": "KBMT must be supported by world knowledge and by linguistic semantic knowledge about meanings of words and their combinations. Thus, a specific language is needed to represent the meaning of languages. Once the SL is analyzed, it will run through the augmenter. It is the knowledgebase that converts the source representation into an appropriate target representation before synthesizing into the target sentence.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Knowledge-Based MT",
"sec_num": "3.5"
},
{
"text": "KBMT systems provide high quality translations. Nevertheless, they are quite expensive to produce due to the large amount of knowledge needed to accurately represent sentences in different languages. The English-Vietnamese MT system is one of the examples of KBMTS.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "57",
"sec_num": null
},
{
"text": "Principle-Based Machine Translation (PBMT) Systems employ parsing methods based on the Principles & Parameters Theory of Chomsky's Generative Grammar. The parser generates a detailed syntactic structure that contains lexical, phrasal, grammatical, and thematic information. It also focuses on robustness, language-neutral representations, and deep linguistic analyses.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Principle-Based MT",
"sec_num": "3.6"
},
{
"text": "In the PBMT, the grammar is thought of as a set of language-independent, interactive well-formed principles and a set of language-dependent parameters. Thus, for a system that uses n languages, one must have n parameter modules and a principles module. Thus, it is well-suited for use with the interlingual architecture.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Principle-Based MT",
"sec_num": "3.6"
},
{
"text": "PBMT parsing methods differ from the rule-based approaches. Although efficient in many circumstances, they have the drawback of language-dependence and increase exponentially in rules if one is using a multilingual translation system. They provide broad coverage of many linguistic phenomena, but lack the deep knowledge about the translation domain that KBMT and EBMT systems employ. Another drawback of current PBMT systems is the lack of the most efficient method for applying the different principles. UNITRAN is one of the examples of PBMT.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Principle-Based MT",
"sec_num": "3.6"
},
{
"text": "In this interactive translation system, the user is allowed to suggest the correct translation to the translator online. This approach is very useful in a situation where the context of a word is unclear and there exists many possible meanings for a particular word. In such cases, the structural ambiguity can be solved with the interpretation of the user.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Online Interactive Systems",
"sec_num": "3.7"
},
{
"text": "The first public Russian to English (Manning et al., 2003) MT system was presented at Georgetown University in 1954 with a vocabulary size of around 250 words. Since then, many research projects have been devoted to MT. Nevertheless, as the complexity of the linguistic phenomena involved in the translation process together with the computational limitations of the time were made apparent, enthusiasm faded out quickly. Also, the results of two negative reports, namely 'Bar-Hillel' and 'AL-PAC,' had a dramatic impact on MT research in that decade.",
"cite_spans": [
{
"start": 36,
"end": 58,
"text": "(Manning et al., 2003)",
"ref_id": "BIBREF24"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Major MT Developments in India: A Literature Survey",
"sec_num": "4."
},
{
"text": "During the 1970s, the focus of MT activity switched from the United States to Canada and Europe, especially due to the growing demands for translations within their multicultural societies. 'Mateo,' a fully-automatic system translating weather forecasts, enjoyed great success in Canada. Meanwhile, the European Commission installed a French-English MT system called 'Systran'. Other research projects, such as 'Eurotra,' 'Ariane,' and 'Susy,' broadened the scope of MT objectives and techniques. The rule-based approaches emerged as the correct path to successful MT quality. Throughout the 1980s, many different types of MT systems appeared with the most prevalent being those using an intermediate semantic language, such as the 'Interlingua' approach.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Major MT Developments in India: A Literature Survey",
"sec_num": "4."
},
{
"text": "Lately, various researchers have shown better translation quality with the use of phrase translation. Most competitive SMT systems, such as CMU, IBM, ISI, and Google, use phrase-based systems with good results.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Major MT Developments in India: A Literature Survey",
"sec_num": "4."
},
{
"text": "In the early 1990s, the progress made by the application of statistical methods to speech recognition, introduced by IBM researchers, was in purely-SMT models (Manning et al., 2003) . The drastic increment in computational power and the increasing availability of written translated texts allowed the development of statistical and other corpus-based MT approaches. Many academic tools turned into useful commercial translation products, and several translation engines were quickly offered in the World Wide Web.",
"cite_spans": [
{
"start": 159,
"end": 181,
"text": "(Manning et al., 2003)",
"ref_id": "BIBREF24"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Major MT Developments in India: A Literature Survey",
"sec_num": "4."
},
{
"text": "Today, there is a growing demand for high-quality automatic translation. Almost all of the research community has moved towards corpus-based techniques, which have systematically outperformed traditional knowledge-based techniques in most performance comparisons. Every year, more research groups embark on SMT experimentation, and there is regained optimism in regards to future progress within the community.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Major MT Developments in India: A Literature Survey",
"sec_num": "4."
},
{
"text": "MT is an emerging research area in NLP for Indian languages, which started more than a decade ago. There have been number of attempts in MT for English to Indian languages and Indian languages to Indian languages using different approaches. The literature shows that the earliest published work was undertaken by Chakraborty in 1966 (Noone et al., 2003) . Many government and private sector researchers, as well as individuals, are actively involved in the development of MT systems and have generated some reasonable MT systems. Some of these MT systems are in the advanced prototype or technology transfer stage, and the rest have been newly initiated. The main developments in Indian language MT systems are as follows.",
"cite_spans": [
{
"start": 333,
"end": 353,
"text": "(Noone et al., 2003)",
"ref_id": "BIBREF28"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Major MT Developments in India: A Literature Survey",
"sec_num": "4."
},
{
"text": "ANGLABHARTI is a multilingual machine aided translation project on translation from English to Indian languages, primarily Hindi, which is based on a pattern directed approach (Durgesh et al., 2000; Sinha et al., 1995; Ajai et al., 2009; Manning et al., 2003; Sudip et al., Machine Translation Approaches and Survey for Indian Languages 59 2005) . The strategy in this MT system is better than the transfer approach and lies below the Interlingua approach. In the first stage, a pattern directed parsing is performed on the SL English, which generates a `pseudo-target' that is applicable to a set of Indian languages. Word sense ambiguity in the SL sentence also is resolved by a number of semantic tags. In order to transform the pseudo TL into the corresponding TL, the system uses a separate text generator module. After correcting all ill-formed target sentences, a post-editing package is used make the final corrections. Even though it is a general purpose system, it has been applied mainly in the domain of public health at present. The ANGLABHARTI system is currently implemented from English to Hindi translation called AnglaHindi which is web-enabled (http://anglahindi.iitk.ac.in) and has obtained good domain-specific results for health campaigns, successfully translating many pamphlets and medical booklets. At present, further research work is going on to extend this approach for English to Telugu/Tamil translation. The project is primarily based at IIT-Kanpur, in collaboration with ER&DCI, Noida, and has been funded by TDIL. Professor RMK Sinha, Indian Institute of Technology, Kanpur is leading this MT project.",
"cite_spans": [
{
"start": 176,
"end": 198,
"text": "(Durgesh et al., 2000;",
"ref_id": null
},
{
"start": 199,
"end": 218,
"text": "Sinha et al., 1995;",
"ref_id": "BIBREF38"
},
{
"start": 219,
"end": 237,
"text": "Ajai et al., 2009;",
"ref_id": null
},
{
"start": 238,
"end": 259,
"text": "Manning et al., 2003;",
"ref_id": "BIBREF24"
},
{
"start": 260,
"end": 345,
"text": "Sudip et al., Machine Translation Approaches and Survey for Indian Languages 59 2005)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "ANGLABHARTI by Indian Institute of Technology, Kanpur (1991)",
"sec_num": "4.1"
},
{
"text": "The disadvantages of the previous system are solved by introducing the ANGLABHARTI -II MT architecture system (Sinha et al., 2003) . The different approach, a Generalized Example-Base (GEB) for hybridization in addition to a Raw Example-Base (REB), is used to improve the performance of the translation. Compared to the previous approach, this system first attempts a match in REB and GEB before invoking the rule-base at the time of actual usage. Automated pre-editing and paraphrasing steps are further improvements in the proposed new translation approach. The system is designed in a way that various submodules are pipelined in order to achieve more accuracy and robustness.",
"cite_spans": [
{
"start": 110,
"end": 130,
"text": "(Sinha et al., 2003)",
"ref_id": "BIBREF37"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "ANGLABHARTI -II by Indian Institute of Technology, Kanpur (2004)",
"sec_num": "4.2"
},
{
"text": "At present, the ANGLABHARTI technology has been transferred under the ANGLABHARTI Mission into eight different sectors across the country (Sudip et al., 2005) . ",
"cite_spans": [
{
"start": 138,
"end": 158,
"text": "(Sudip et al., 2005)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "ANGLABHARTI -II by Indian Institute of Technology, Kanpur (2004)",
"sec_num": "4.2"
},
{
"text": "ANUBHARATI is a recently started MT system aimed at translating from Hindi to English (Durgesh et al., 2000; Sinha et al., 1995; Ajai et al., 2009; Sudip et al., 2005) . Similar to the ANGLABHARTI MT system, ANUBHARATI is also based on machine aided translation in which a variation of the example-based approach, called a template or hybrid HEBM, is used. The literature shows that a prototype version of the MT system has been developed and the project is being extended for developing a complete system. The HEBMT approach takes advantage of pattern and example-based approaches by combining the essentials of these methods. One more added advantage of the ANUBHARATI system is that it provides a generic model for translation that is suitable for translation between any two Indian languages pair with a minor addition of modules.",
"cite_spans": [
{
"start": 86,
"end": 108,
"text": "(Durgesh et al., 2000;",
"ref_id": null
},
{
"start": 109,
"end": 128,
"text": "Sinha et al., 1995;",
"ref_id": "BIBREF38"
},
{
"start": 129,
"end": 147,
"text": "Ajai et al., 2009;",
"ref_id": null
},
{
"start": 148,
"end": 167,
"text": "Sudip et al., 2005)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "ANUBHARATI by Indian Institute of Technology, Kanpur (1995)",
"sec_num": "4.3"
},
{
"text": "ANUBHARATI-II is a revised version of the ANUBHARATI that overcomes most of the drawbacks of the earlier architecture with a varying degree of hybridization of different paradigms (Sudip et al., 2005) . The main intention of this system is to develop Hindi to any other Indian languages, with a generalized hierarchical example-based approach. Nevertheless, while both ANGLABHARTI-I and ANUBHARTI-II did not produce the expected results, both systems have been implemented successfully with good results. Professor RMK Sinha, Indian Institute of Technology, Kanpur is leading this MT project.",
"cite_spans": [
{
"start": 180,
"end": 200,
"text": "(Sudip et al., 2005)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "ANUBHARATI-II by Indian Institute of Technology, Kanpur (2004)",
"sec_num": "4.4"
},
{
"text": "To utilize the close similarity among Indian languages for MT, another translation system called Anusaaraka (Durgesh et al., 2000; Sudip et al., 2005) , was introduced, which is based on the principles of Paninian Grammar (PG). Anusaaraka is a machine aided translation system that also is used on language access between these languages. At present, this system is applied to children's stories, and an Alpha version of the system has been developed already for language assessors from five regional languages Punjabi, Bengali, Telugu, Kannada, and Marathi into Hindi. The Anusaaraka MT approach mainly consists of two modules (Manning et al., 2003; Bharati et al., 1997) . The first module is called Core Anusaaraka, which is based on language knowledge, and the second one is a domain specific module that is based on statistical knowledge, world knowledge, etc. That is, the idea behind Anusaaraka is different from other systems in that the total load is divided in-to parts. The machine carries out the language-based analysis of the text, and the remaining work, such as knowledge-based analysis or interpretation, is performed by the reader. The Anusaaraka project was funded by TDIL,started at IIT Kanpur, and later shifted mainly to the Centre for Applied Linguistics and ",
"cite_spans": [
{
"start": 108,
"end": 130,
"text": "(Durgesh et al., 2000;",
"ref_id": null
},
{
"start": 131,
"end": 150,
"text": "Sudip et al., 2005)",
"ref_id": null
},
{
"start": 628,
"end": 650,
"text": "(Manning et al., 2003;",
"ref_id": "BIBREF24"
},
{
"start": 651,
"end": 672,
"text": "Bharati et al., 1997)",
"ref_id": "BIBREF4"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Anusaaraka by Indian Institute of Technology, Kanpur and University of Hyderabad",
"sec_num": "4.5"
},
{
"text": "The Anusaaraka system from English to Hindi preserves the basic principles of information preservation and load distribution of original Anusaaraka (Manning et al., 2003; Bharati et al., 1997) . To analyze the source text, it uses a modified version of the XTAG based super tagger and light dependency analyzer that was developed at the University of Pennsylvania. The advantage of this system is that, after the completion of the source text analysis, the user may read the output and can always move to a simpler output if the system produces the wrong output or fails to produce output.",
"cite_spans": [
{
"start": 148,
"end": 170,
"text": "(Manning et al., 2003;",
"ref_id": "BIBREF24"
},
{
"start": 171,
"end": 192,
"text": "Bharati et al., 1997)",
"ref_id": "BIBREF4"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Anusaaraka System from English to Hindi",
"sec_num": "4.6"
},
{
"text": "MaTra is an English to Indian languages (at present Hindi) Human-Assisted translation system based on a transfer approach using a frame-like structured representation that resolves the ambiguities using rule-based and heuristics approaches (Durgesh et al., 2000; Sudip et al., 2005; Manning et al., 2003) . MaTra is an innovative system, which provides an intuitive GUI, where the user visually can inspect the analysis of the system and can provide disambiguation information to produce a single correct translation. Even though the MaTra system is intended to be a general purpose system, it has been applied mainly in the domains of news, annual reports, and technical phrases. MaTra is an ongoing project and the system currently is able to translate domain-specific simple sentences. Current development is towards covering other types of sentences. The Natural Language group of the Knowledge Based Computer Systems (KBCS) division at the National Centre for Software Technology (NCST), Mumbai (currently CDAC, Mumbai) has undertaken the task developing the MaTra system and is funded by TDIL.",
"cite_spans": [
{
"start": 240,
"end": 262,
"text": "(Durgesh et al., 2000;",
"ref_id": null
},
{
"start": 263,
"end": 282,
"text": "Sudip et al., 2005;",
"ref_id": null
},
{
"start": 283,
"end": 304,
"text": "Manning et al., 2003)",
"ref_id": "BIBREF24"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "MaTra (2004)",
"sec_num": "4.7"
},
{
"text": "The Mantra MT system is intended to perform translation for the domains of gazette notifications pertaining to government appointments and parliamentary proceeding summaries between English and Indian languages as well as from Indian languages to English, where source and TL grammars are represented using Lexicalized Tree Adjoining Grammar (LTAG) formalism (Durgesh et al., 2000; Sudip et al., 2005) . The added advantage of this system is that the system can also preserve the formatting of input Word documents across the translation. After the successful development of MANTRA-Rajyasabha, language pairs like Hindi-English and Hindi-Bengali translation already have started using the Mantra approach. The Mantra project is being developed under the supervision of Dr. Hemant Darbari and is funded by TDIL and the Department of Official Languages, Ministry of Home Affairs, Government of India.",
"cite_spans": [
{
"start": 359,
"end": 381,
"text": "(Durgesh et al., 2000;",
"ref_id": null
},
{
"start": 382,
"end": 401,
"text": "Sudip et al., 2005)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "MANTRA by Centre for Development of Advanced Computing, Bangalore (1999)",
"sec_num": "4.8"
},
{
"text": "Using the Universal Clause Structure Grammar (UCSG) formalism, the Computer and Information Sciences Department at the University of Hyderabad, under the supervision of Prof. K. Narayana Murthy, developed a domain-specific English- Kannada MT system (Durgesh et al., 2000; Sudip et al., 2005; Manning et al., 2003) . This UCSG-based system is based on a transfer-based approach and has been applied to the translation of government circulars. The system work is done at the sentence level and requires post-editing. At its first step of translation, the source (English) sentence is analysed and parsed using UCSG parser (developed by Dr. K. Narayana Murthy). Then, using translation rules, an English-Kannada bilingual dictionary, and network based Kannada Morphological Generator (developed by Dr. K. Narayana Murthy), the system translates in-to the Kannada language. This project has been funded by government of Karnataka and work is going to improve the performance of the system. Later, the same approach was applied for English-Telugu translation.",
"cite_spans": [
{
"start": 232,
"end": 272,
"text": "Kannada MT system (Durgesh et al., 2000;",
"ref_id": null
},
{
"start": 273,
"end": 292,
"text": "Sudip et al., 2005;",
"ref_id": null
},
{
"start": 293,
"end": 314,
"text": "Manning et al., 2003)",
"ref_id": "BIBREF24"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "UCSG-based English-Kannada MT by University of Hyderabad",
"sec_num": "4.9"
},
{
"text": "Universal Networking Language (UNL) MT between English, Hindi, and Marathi is based on the Interlingua approach (Durgesh et al., 2000; Sudip et al., 2005; Manning et al., 2003) . Under the supervision of Prof. Pushpak Bhattacharya, IIT Bombay is the Indian participant in UNL, which is an international project of the United Nations University, aimed at developing an Interlingua for all major human languages in the world. In the UNL based MT, the knowledge of the SL is captured or converted into UNL form and reconverted from UNL to the TL, like Hindi and Marathi. The SL information is represented sentence by sentence which is later converted into a hypergraph having concepts as nodes and relations as directed arcs (Shachi et al., 2002) . The document knowledge is expressed in three dimensions as word knowledge, conceptual knowledge, and attritute labels.",
"cite_spans": [
{
"start": 112,
"end": 134,
"text": "(Durgesh et al., 2000;",
"ref_id": null
},
{
"start": 135,
"end": 154,
"text": "Sudip et al., 2005;",
"ref_id": null
},
{
"start": 155,
"end": 176,
"text": "Manning et al., 2003)",
"ref_id": "BIBREF24"
},
{
"start": 722,
"end": 743,
"text": "(Shachi et al., 2002)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "UNL-based MT between English, Hindi and Marathi by Indian Institute of Technology, Mumbai",
"sec_num": "4.10"
},
{
"text": "The KB Chandrasekhar Research Centre of Anna University at Chennai is active in the area of Tamil NLP. A Tamil-Hindi language assessor has been built using the Anusaaraka formalism (Durgesh et al., 2000; Sudip et al., 2005; Manning et al., 2003) . The group has developed a Tamil-Hindi machine aided translation system under the supervision of Prof. CN Krishnan, with a performance of 75%.",
"cite_spans": [
{
"start": 181,
"end": 203,
"text": "(Durgesh et al., 2000;",
"ref_id": null
},
{
"start": 204,
"end": 223,
"text": "Sudip et al., 2005;",
"ref_id": null
},
{
"start": 224,
"end": 245,
"text": "Manning et al., 2003)",
"ref_id": "BIBREF24"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Tamil-Hindi Anusaaraka MT",
"sec_num": "4.11"
},
{
"text": "Recently, the NLP group also developed a prototype of English-Tamil Human Aided MT System (Manning et al., 2003; Dwivedi et al., 2010) . The system mainly consists of three major components: an English morphological analyzer, a mapping unit, and the Tamil language morphological generator.",
"cite_spans": [
{
"start": 90,
"end": 112,
"text": "(Manning et al., 2003;",
"ref_id": "BIBREF24"
},
{
"start": 113,
"end": 134,
"text": "Dwivedi et al., 2010)",
"ref_id": "BIBREF12"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "English-Tamil machine Aided Translation system",
"sec_num": "4.12"
},
{
"text": "This project was developed jointly by the Indian Institute of Science, Bangalore, and International Institute of Information Technology, Hyderabad, in collaboration with Carnegie Mellon University based on an example-based approach (Sudip et al., 2005; Dwivedi et al., 2010 ). An experimental system has been released for experiments, trials, and user feedback and is publicly available.",
"cite_spans": [
{
"start": 232,
"end": 252,
"text": "(Sudip et al., 2005;",
"ref_id": null
},
{
"start": 253,
"end": 273,
"text": "Dwivedi et al., 2010",
"ref_id": "BIBREF12"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "SHIVA MT System for English to Hindi",
"sec_num": "4.13"
},
{
"text": "This is a recently started project that also was developed jointly by Indian Institute of Science, Bangalore, and International Institute of Information Technology, Hyderabad, in collaboration with Carnegie Mellon University (Sudip et al., 2005; Dwivedi et al., 2010) . The system follows a hybrid approach by combining both rule and statistical-based approaches. An experimental system for English to Hindi, Marathi, and Telugu is publicly available for experiments, trials, and user feedback.",
"cite_spans": [
{
"start": 225,
"end": 245,
"text": "(Sudip et al., 2005;",
"ref_id": null
},
{
"start": 246,
"end": 267,
"text": "Dwivedi et al., 2010)",
"ref_id": "BIBREF12"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "SHAKTI MT System for English to Hindi, Marathi and Telugu",
"sec_num": "4.14"
},
{
"text": "Anuvadak 5.0 English to Hindi software is a general-purpose tool developed by the private sector company Super Infosoft Pvt Ltd., Delhi, under the supervision of Mrs. Anjali Rowchoudhury (Durgesh et al., 2000; Sudip et al., 2005; Manning et al., 2003; Dwivedi et al., 2010) . The system has inbuilt dictionaries in specific domains and supports post-editing. If the corresponding target word is not present in the lexicon, the system has a facility to translate that source word into the target. The system can run in Windows and a demonstration version of the system is publicly available.",
"cite_spans": [
{
"start": 187,
"end": 209,
"text": "(Durgesh et al., 2000;",
"ref_id": null
},
{
"start": 210,
"end": 229,
"text": "Sudip et al., 2005;",
"ref_id": null
},
{
"start": 230,
"end": 251,
"text": "Manning et al., 2003;",
"ref_id": "BIBREF24"
},
{
"start": 252,
"end": 273,
"text": "Dwivedi et al., 2010)",
"ref_id": "BIBREF12"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Anuvadak English-Hindi MT",
"sec_num": "4.15"
},
{
"text": "A statistical-based English to Indian languages, mainly Hindi, MT system was started by IBM India Research Lab at New Delhi, using the same approach as its existing work on other languages (Durgesh et al., 2000; Manning et al., 2003) .",
"cite_spans": [
{
"start": 189,
"end": 211,
"text": "(Durgesh et al., 2000;",
"ref_id": null
},
{
"start": 212,
"end": 233,
"text": "Manning et al., 2003)",
"ref_id": "BIBREF24"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "English-Hindi Statistical MT",
"sec_num": "4.16"
},
{
"text": "A rule-based English to Hindi Machine Aided Translation system was developed by Jadavpur University, Kolkata, under the supervision of Prof. Sivaji Bandyopadhyay (Durgesh et al., 2000) . The system uses the transfer based approach and is currently working on domain specific MT system for news sentences.",
"cite_spans": [
{
"start": 162,
"end": 184,
"text": "(Durgesh et al., 2000)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "English-Hindi MAT for news sentences",
"sec_num": "4.17"
},
{
"text": "Under the supervision of Prof. Sivaji Bandyopadhyay, a hybrid-based MT system for English to Bengali was developed at Jadavpur University, Kolkata, in 2004 (Dwivedi et al., 2010 . The current version of the system works at the sentence level.",
"cite_spans": [
{
"start": 139,
"end": 155,
"text": "Kolkata, in 2004",
"ref_id": null
},
{
"start": 156,
"end": 177,
"text": "(Dwivedi et al., 2010",
"ref_id": "BIBREF12"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "A hybrid MT system for English to Bengali",
"sec_num": "4.18"
},
{
"text": "In 2004, Prof. Sinha and Prof. Thakur developed a standard Hindi-English MT system called Hinglish by incorporating an additional level in the existing ANGLABHARTI-II and ANUBHARTI-II systems (Dwivedi et al., 2010) . The system produced satisfactory results in more than 90% of the cases, except the case with polysemous verbs.",
"cite_spans": [
{
"start": 192,
"end": 214,
"text": "(Dwivedi et al., 2010)",
"ref_id": "BIBREF12"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Hinglish MT system",
"sec_num": "4.19"
},
{
"text": "An example-based English to Hindi, Kannada, and Tamil, as well as Kannada to Tamil (Dwivedi et al., 2010) , MT system was developed by Balajapally et al. (2006) . A set of bilingual dictionaries comprised of a sentence dictionary, phrase-dictionary, word-dictionary, and phonetic-dictionary of parallel corpora of sentences, phrases, words, and phonetic mappings of words is used for the MT. A corpus size of 75,000 most commonly used English-{Hindi, Kannada and Tamil} sentence pairs are used for MT.",
"cite_spans": [
{
"start": 83,
"end": 105,
"text": "(Dwivedi et al., 2010)",
"ref_id": "BIBREF12"
},
{
"start": 135,
"end": 160,
"text": "Balajapally et al. (2006)",
"ref_id": "BIBREF3"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "English to (Hindi, Kannada, Tamil) and Kannada to Tamil language-pair EBMT system (2006)",
"sec_num": "4.20"
},
{
"text": "A direct word-to-word translation approach, a Punjabi to Hindi MT system, was developed by Josan and Lehal at Punjabi University, Patiala, and reported 92.8% accuracy (Dwivedi et al., 2010) . In addition to the Punjabi-Hindi lexicon and morphological analysis, the system also consists of modules that support word sense disambiguation, transliteration, and post-processing.",
"cite_spans": [
{
"start": 167,
"end": 189,
"text": "(Dwivedi et al., 2010)",
"ref_id": "BIBREF12"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Punjabi to Hindi MT system (2007)",
"sec_num": "4.21"
},
{
"text": "Consortiums of institutions (including IIIT Hyderabad, University of Hyderabad, CDAC (Noida, Pune), Anna University, KBC, Chennai, IIT Kharagpur, IIT Kanpur, IISc Bangalore, IIIT Alahabad, Tamil University, Jadavpur University) started to develop MT systems among Indian languages, called Sampark and have already released experimental systems for {Punjabi, Urdu, Tamil, Marathi} to Hindi and Tamil-Hindi in 2009 (Dwivedi et al., 2010) .",
"cite_spans": [
{
"start": 413,
"end": 435,
"text": "(Dwivedi et al., 2010)",
"ref_id": "BIBREF12"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "MT System among Indian language -Sampark (2009)",
"sec_num": "4.22"
},
{
"text": "Using a phrasal example-based approach, Jadavpur University developed a domain-specific translation of English news to Bengali called ANUBAAD, with current system work at the sentence level (Sudip et al., 2005) . Also, the university started to develop a translation system for English news headlines to Bengali using a semantics-example-based approach. Using the same architecture, the university also developed a MT system for English-Hindi, and the system works currently at the simple sentence level. Recently the university also started to develop an Indian languages (Bengali, Manipuri) to English MT system. These translation systems are developing under the supervision of Prof. Sivaji Bandyopadhyay. The university uses these translation systems for guiding students and researchers who work in the MT area.",
"cite_spans": [
{
"start": 190,
"end": 210,
"text": "(Sudip et al., 2005)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "English to Bengali (ANUBAAD) and English to Hindi MT System by Jadavpur University",
"sec_num": "4.23"
},
{
"text": "Utkal University, Bhuvaneshwar is working on an English-Oriya MT system OMTrans under the supervision of Prof. Sanghamitra Mohanty (Sudip et al., 2005; Manning et al., 2003) . In addition to the parser and Oriya Morphological Analyser (OMA), the system also consists of an N-gram based word sense disambiguation module.",
"cite_spans": [
{
"start": 131,
"end": 151,
"text": "(Sudip et al., 2005;",
"ref_id": null
},
{
"start": 152,
"end": 173,
"text": "Manning et al., 2003)",
"ref_id": "BIBREF24"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Oriya MT System (OMTrans) by Utkal University, Vanivihar",
"sec_num": "4.24"
},
{
"text": "The Department of Mathematics, IIT Delhi, under the supervision of Professor Niladri Chatterjee developed an example-based English-Hindi MT system (Sudip et al., 2005) . They have developed divergence algorithms for identifying the divergence for English to Hindi example-based system and a systematic scheme for retrieval from the English-Hindi example base.",
"cite_spans": [
{
"start": 147,
"end": 167,
"text": "(Sudip et al., 2005)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "English-Hindi EBMT system by IIT Delhi",
"sec_num": "4.25"
},
{
"text": "Using the Machine Aided Translation system approach, a domain-specific translation system for translating public health related sentences from English to Hindi was developed (Manning et al., 2003) . The system supports the advantage of post-editing and reportes 60% performance.",
"cite_spans": [
{
"start": 174,
"end": 196,
"text": "(Manning et al., 2003)",
"ref_id": "BIBREF24"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Machine Aided Translation by Centre for Development of Advanced Computing (CDAC), Noida",
"sec_num": "4.26"
},
{
"text": "Goyal and Lehal of Punjabi University, Patiala, developed a Hindi to Punjabi MT system based on a direct word-to-word translation approach (Goyal et al., 2009; Dwivedi et al., 2010) .",
"cite_spans": [
{
"start": 139,
"end": 159,
"text": "(Goyal et al., 2009;",
"ref_id": "BIBREF13"
},
{
"start": 160,
"end": 181,
"text": "Dwivedi et al., 2010)",
"ref_id": "BIBREF12"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Hindi to Punjabi MT system (2009)",
"sec_num": "4.27"
},
{
"text": "The system consists of the following modules: pre-processing, a word-to-word Hindi-Punjabi lexicon, morphological analysis, word sense disambiguation, transliteration, and post-processing. They also have developed an evaluation approach for a Hindi to English translation system and have reported 95% accuracy. Still, work is being carried out to achieve a better system.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Hindi to Punjabi MT system (2009)",
"sec_num": "4.27"
},
{
"text": "Ruvan Weerasinghe developed an SMT Approach to Sinhala-Tamil Language Translation (Weerasinghe et al., 2011) . This work reports on SMT based translation performed between language pairs, such as the Sinhala-Tamil and English-Sinhala pairs. The experiments results show that current models perform significantly better for the Sinhala-Tamil pair than the English-Sinhala pair and prove that the SMT system works better for languages that are not too distantly related to each other.",
"cite_spans": [
{
"start": 82,
"end": 108,
"text": "(Weerasinghe et al., 2011)",
"ref_id": "BIBREF42"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "A Statistical MT Approach to Sinhala-Tamil Language (2011)",
"sec_num": "4.28"
},
{
"text": "Dr. Vasu Renganathan, University of Pennsylvania, developed an interactive approach for an English-Tamil MT System on the Web (Samir et al., 2010). The system is set on a rule-based approach, containing around five thousand words in the lexicon and a number of transfer rules used for mapping English structures to Tamil structures. This is an interactive system in that users can update this system by adding more words into the lexicon and rules into the rule-base.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "An Interactive Approach for English-Tamil MT System on the Web (2002)",
"sec_num": "4.29"
},
{
"text": "Samir Kr. Borgohain and Shivashankar B. Nair introduced a new MT approach for Pictorially Grounded Language (PGL) based on their pictorial knowledge (Samir et al., 2010) . In this approach, symbols of both the source and the TLs are grounded on a common set of images and animations. PGL is a graphic language and acts as a conventional intermediate language representation. While preserving the inherent meanings of the SL, the translation mechanism can also be scalable into a larger set of languages. The translation system is implemented in such a way that images and objects are tagged with both the source and target language equivalents, which makes the reverse translation much easier.",
"cite_spans": [
{
"start": 149,
"end": 169,
"text": "(Samir et al., 2010)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Translation system using pictorial knowledge representation (2010)",
"sec_num": "4.30"
},
{
"text": "This is an attempt to develop a statistical-based MT for English to Malayalam language by a set of MTech students under the guidance of Dr. K P Soman (Rahul et al., 2009) . In this approach, they showed that a SMT based system can be improved by incorporating the rule-based reordering and morphological information of source and target languages.",
"cite_spans": [
{
"start": 150,
"end": 170,
"text": "(Rahul et al., 2009)",
"ref_id": "BIBREF31"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Rule-based Reordering and Morphological Processing For English-Malayalam SMT (2009)",
"sec_num": "4.31"
},
{
"text": "A piloted SMT based English to Telugu MT (MT) System called \"enTel\" was developed by Anitha Nalluri and Vijayanand Kommaluri, based on Johns Hopkins University Open Source Architecture (JOSHUA) (Anitha et al., 2011) . A Telugu parallel corpus from the Enabling Minority Language Engineering (EMILLE) developed by CIIL Mysore and English to Telugu Dictionary, developed by Charles Philip Brown, is considered for training the translation system.",
"cite_spans": [
{
"start": 194,
"end": 215,
"text": "(Anitha et al., 2011)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "SMT using Joshua (2011)",
"sec_num": "4.32"
},
{
"text": "The NLP team, including Prashanth Balajapally, Phanindra Bandaru, Ganapathiraju, N. Balakrishnan and Raj Reddy, introduced a multilingual book reader interface for DLI that supports transliteration and good enough translation (Prashanth) based on transliteration, word to word translation and full-text translation for Indian language. This is a simple, inexpensive tool that exploits the similarity between Indian languages. This tool can be useful for beginners who can understand their mother tongue or other Indian languages, but cannot read the script, and for an average reader who has the domain expertise. This tool can be also be used for translating either the documents or the queries in a multilingual search purpose.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Multilingual Book Reader",
"sec_num": "4.33"
},
{
"text": "Vamshi Ambati and U Rohini proposed a hybrid approach to EBMT (EBMT) for English to Indian languages that makes use of SMT methods and minimal linguistic resources (Ambati et al., 2007) . Currently work is going on to develop English to Hindi as well as other Indian language translation systems based on manual and a statistical dictionary built from an SMT tool using an example database consisting of source and target parallel sentences.",
"cite_spans": [
{
"start": 164,
"end": 185,
"text": "(Ambati et al., 2007)",
"ref_id": "BIBREF1"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "A Hybrid Approach to EBMT for English to Indian Languages (2007)",
"sec_num": "4.34"
},
{
"text": "Ananthakrishnan Ramanathan, Pushpak Bhattacharyya, Jayprasad Hegde, Ritesh M. Shah, and M. Sasikumar proposed a new idea to improve the performance of the SMT based MT by incorporating syntactic and morphological processing (Ananthakrishnan). In this contest, they proved that performance of a baseline phrase-based system can be substantially improved by i)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "SMT by Incorporating Syntactic and Morphological Processing",
"sec_num": "4.35"
},
{
"text": "reordering the source (English) sentence as per target (Hindi) syntax, and (ii) using the suffixes of target (Hindi) words.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "SMT by Incorporating Syntactic and Morphological Processing",
"sec_num": "4.35"
},
{
"text": "This is a very different approach to MT that is intended for dissemination of information to the deaf people in India and was proposed by Tirthankar Dasgupta, Sandipan Dandpat, and Anupam Basu (Dasgupta et al. 2008; Harshawardhan et al., 2011) . At present, a prototype version of English to Indian Sign Language has been developed and the ISL syntax is represented based on Lexical Functional Grammar (LFG) formalism.",
"cite_spans": [
{
"start": 138,
"end": 215,
"text": "Tirthankar Dasgupta, Sandipan Dandpat, and Anupam Basu (Dasgupta et al. 2008;",
"ref_id": null
},
{
"start": 216,
"end": 243,
"text": "Harshawardhan et al., 2011)",
"ref_id": "BIBREF15"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Prototype MT System from Text-To-Indian Sign Language (ISL)",
"sec_num": "4.36"
},
{
"text": "In the proposed work, a different approach that makes use of the karaka relations for sentence comprehension is used in the frame-based translation system for Dravidian languages (Idicula et al., 1999) . Two pattern-directed application-oriented experiments are conducted, and the same meaning representation technique is used in both cases. In the first experiment, translation is done from a free word order language to fixed word order one, where both the source and destination are natural languages. In the second experiment, however, the TL is an artificial language with a rigid syntax. Even though there is a difference in the generation of the target sentence, the results obtained in both experiments are encouraging.",
"cite_spans": [
{
"start": 179,
"end": 201,
"text": "(Idicula et al., 1999)",
"ref_id": "BIBREF20"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "An Adaptable Frame based system for Dravidian language Processing (1999)",
"sec_num": "4.37"
},
{
"text": "CALTS in collaboration with IIIT, Hyderabad; Telugu University, Hyderabad; and Osmania University, Hyderabad developed an English-Telugu and Telugu-Tamil MT system under the supervision of Prof. Rajeev Sangal (CALTS). The English-Telugu system uses an English-Telugu machine aided translation lexicon of size 42000 words and a wordform synthesizer for Telugu. The Telugu-Tamil MT system was developed based on the available resources at CALTS: Telugu Morphological analyzer, Tamil generator, verb sense disambiguator, and Telugu-Tamil machine aided translation dictionary. The performance of the systems is encouraging, and it handles source sentences of varying complexity.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "English-Telugu T2T MT and Telugu-Tamil MT System (2004)",
"sec_num": "4.38"
},
{
"text": "R. Mahesh K. Sinha proposed a different strategy for deriving English to Urdu translation using an English to Hindi MT system (R. Mahesh et al., 2009) . In the proposed method, an English-Hindi lexical database is used to collect all possible Hindi words and phrases. These words and phrases are further augmented by including their morphological variations and attaching all possible postpositions. Urdu is structurally very close to Hindi and this augmented list is used to provide mapping from Hindi to Urdu. The advantage of this translation system is that the grammatical analysis of English provides all the necessary information needed for Hindi to Urdu mapping and no part of speech tagging, chunking, or parsing of Hindi has been used for translation.",
"cite_spans": [
{
"start": 130,
"end": 150,
"text": "Mahesh et al., 2009)",
"ref_id": "BIBREF23"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Developing English-Urdu MT Via Hindi (2009)",
"sec_num": "4.39"
},
{
"text": "Kommaluri Vijayanand, S. Choudhury and Pranab Ratna proposed an automatic bilingual MT for Bengali to Assamese using an example-based approach (Kommaluri et al., 2002) . They used a manually created aligned bilingual corpus by feeding real examples using pseudo code. The quality of the translation was improved by preprocessing the longer input sentences and also via the backtracking techniques. Since the grammatical structure of Bengali and Assamese is very similar, lexical word groups are required.",
"cite_spans": [
{
"start": 143,
"end": 167,
"text": "(Kommaluri et al., 2002)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Bengali-Assamese automatic MT system-VAASAANUBAADA (2002)",
"sec_num": "4.40"
},
{
"text": "The Computational Engineering and Networking research centre of Amrita School of Engineering, Coimbatore, proposed an English-Tamil translation system. The system is set on a phrase-based approach by incorporating concept labeling using translation memory of parallel corpora (Harshawardhan et al., 2011 ). The translation system consists of 50,000 English-Tamil parallel sentences, 5000 proverbs, and 1000 idioms and phrases, with a dictionary containing more than 2,00,000 technical words and 100,000 general words. The system has an accuracy of 70%.",
"cite_spans": [
{
"start": 276,
"end": 303,
"text": "(Harshawardhan et al., 2011",
"ref_id": "BIBREF15"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Phrase based English-Tamil Translation System by Concept Labeling using Translation Memory (2011)",
"sec_num": "4.41"
},
{
"text": "This work is aimed at improving the translation quality of an MT system by simplifying the complex input sentences for an English to Tamil MT system (Poornima et al., 2011) . In order to simplify the complex sentences based on connectives, like relative pronouns or coordinating and subordinating conjunctions, a rule-based technique is proposed. In this approach, a complex sentence is expressed as a list of sub-sentences while the meaning remains unaltered. The simplification task can be used as a preprocessing tool for MT where the initial splitting is based on delimiters and the simplification is based on connectives.",
"cite_spans": [
{
"start": 149,
"end": 172,
"text": "(Poornima et al., 2011)",
"ref_id": "BIBREF30"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Rule-based Sentence Simplification for English to Tamil MT System (2011)",
"sec_num": "4.42"
},
{
"text": "Using morphology and dependency relations, a Manipuri to English bidirectional SMT system was developed by Thoudam Doren Singh and Sivaji Bandyopadhyay (Doren Singh et al., 2010) . The system uses a domain-specific parallel corpus of 10350 sentences from news for training purposes and the system is tested with 500 sentences.",
"cite_spans": [
{
"start": 121,
"end": 178,
"text": "Singh and Sivaji Bandyopadhyay (Doren Singh et al., 2010)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Manipuri-English Bidirectional SMT Systems (2010)",
"sec_num": "4.43"
},
{
"text": "P.J. Antony, P. Unnikrishnan and Dr. K.P Soman proposed an SMT system for English to Kannada by incorporating syntactic and morphological information (Unnikrishnan et al., 2010) . In order to increase the performance of the translation system, we have introduced a new approach in creating the parallel corpus. The main ideas that we have implemented and proven effective in the English to Kannada SMT system are: (i) reordering the English source sentence according to Dravidian syntax, (ii) using the root suffix separation on both English and Dravidian words, and iii) use of morphological information that substantially reduces the corpus size required for training the system. The results show that significant improvements are possible by incorporating syntactic and morphological information into the corpus. From the experiments we have found that the proposed translation system successfully works for almost all simple sentences in their twelve tense forms and their negatives forms.",
"cite_spans": [
{
"start": 150,
"end": 177,
"text": "(Unnikrishnan et al., 2010)",
"ref_id": "BIBREF39"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "English to Kannada SMT System (2010)",
"sec_num": "4.44"
},
{
"text": "This system is an effort of the English to Indian Language MT (EILMT) consortium. Anuvadaksh is a system that allows translating the text from English to six other Indian languages, i.e. Hindi, Urdu, Oriya, Bangla, Marathi, and Tamil. Anuvadaksh being a consortium based project has a hybrid approach that is designed to work with platform and technology independent modules.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Anuvadaksh",
"sec_num": "4.45"
},
{
"text": "This system has been developed to facilitate the multi-lingual community, initially in the domain-specific expressions of tourism, and it would subsequently foray into various other domains in a phase-wise manner. It integrates four MT Technologies:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Anuvadaksh",
"sec_num": "4.45"
},
{
"text": "Tree-Adjoining-Grammar (TAG) based MT. SMT. Analyze and Generate rules (Anlagen) based MT. Example-based MT (EBMT).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Anuvadaksh",
"sec_num": "4.45"
},
{
"text": "Google Translate is a free translation service that provides instant translations between 57 different languages. Google Translate generates a translation by looking for patterns in hundreds of millions of documents to help decide on the best translation. By detecting patterns in documents that have already been translated by human translators, Google Translate makes guesses as to what an appropriate translation should be. This process of seeking patterns in large amounts of text is called \"SMT\".",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Google Translate",
"sec_num": "4.46"
},
{
"text": "An English to Assamese MT system is in progress (Sudhir et al., 2007) . The following activities are in progress in this direction.",
"cite_spans": [
{
"start": 48,
"end": 69,
"text": "(Sudhir et al., 2007)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "English to Assamese MT System",
"sec_num": "4.47"
},
{
"text": "\u2022 The graphical user interface of the MT system has been re-designed. It now allows the display of Assamese text. Modifications have been made in the Java modules.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "English to Assamese MT System",
"sec_num": "4.47"
},
{
"text": "\u2022 The existing Susha encoding scheme has been used. In addition, a new Assamese font set has been created according to that of Susha font set. The system is now able to display properly consonants, vowels, and matras of Assamese characters properly.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "English to Assamese MT System",
"sec_num": "4.47"
},
{
"text": "\u2022 The mapping of the Assamese keyboard with that of Roman has been worked out.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "English to Assamese MT System",
"sec_num": "4.47"
},
{
"text": "\u2022 The process of entering Assamese words (equivalent of English words) in the lexical database (nouns and verbs) is in progress.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "English to Assamese MT System",
"sec_num": "4.47"
},
{
"text": "The system developed basically a rule-based approach and relies on a bilingual English to Assamese dictionary. The dictionary-supported generation of Assamese text from English text is a major stage in this MT. Each entry in the dictionary is supplied with inflectional information about the English lexeme and all of its Assamese equivalents. The dictionary is annotated for morphological, syntactic, and partially semantic information. It currently can handle translation of simple sentences from English to Assamese. The dictionary contains around 5000 root words. The system simply translates source language texts to the corresponding target language texts phrase to phrase by means of the bilingual dictionary lookup.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "English to Assamese MT System",
"sec_num": "4.47"
},
{
"text": "Tamil University, Tanjore, initiated a machine oriented translation from Russian-Tamil during 1983 -1984 under the leadership of Vice-Chancellor Dr. V.I Subramaniam (Sudhir et al., 2007) . It was taken up as an experimental project to study and compare Tamil with Russian in order to translate Russian scientific text into Tamil. A team consisting of a linguist, a Russian language scholar, and a computer scientist were entrusted to work on this project. During the preliminary survey, both Russian SL and Tamil were compared thoroughly for their style, syntax, morphological level, etc.",
"cite_spans": [
{
"start": 73,
"end": 98,
"text": "Russian-Tamil during 1983",
"ref_id": null
},
{
"start": 99,
"end": 104,
"text": "-1984",
"ref_id": null
},
{
"start": 165,
"end": 186,
"text": "(Sudhir et al., 2007)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Tamil University MT System",
"sec_num": "4.48"
},
{
"text": "Bharathidasan University, Tamilnadu, is working on translation between languages belonging to the same family, such as Tamil-Malayalam translation (Sudhir et al., 2007) . The MT consists of the following modules that are in progress.",
"cite_spans": [
{
"start": 147,
"end": 168,
"text": "(Sudhir et al., 2007)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Tamil-Malayalam MT System",
"sec_num": "4.49"
},
{
"text": "Lexical database-This will be a bilingual dictionary of root words. All the noun roots and verb roots are collected. ",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Tamil-Malayalam MT System",
"sec_num": "4.49"
},
{
"text": "This survey described machine translation (MT) techniques in a longitudinal and latitudinal way with an emphasis on the MT development for Indian languages. Additionally, we tried to describe briefly the different existing approaches that have been used to develop MT systems. From the survey, we found that almost all existing Indian language MT projects are based on a statistical and hybrid approach. We also identified the following two reasons that most of the developed MT systems for Indian languages have followed the statistical and hybrid approach. The first reason is, since Indian languages are morphologically rich in features and agglutinative in nature, rule-based approaches have failed in many situations for developing full-fledged MT systems. Second the general benefits of statistical and hybrid approaches have encouraged researchers to choose these approaches to develop MT systems for Indian languages.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion",
"sec_num": "5."
},
{
"text": "Kitty Hawk, North Carolina, USA was the site for the world's first successful powered human flight by the Wright brothers. \"Kitty Hawk\" references generally meant a break-through success in its early stages.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
}
],
"back_matter": [
{
"text": "Suffix database-Inflectional suffixes, derivative suffixes, plural markers, tense markers, sariyai, case suffixes, relative participle markers, verbal participle markers, etc will be compiled.Morphological Analyzer-This is designed to analyze the constituents of the words. It will help to segment the words into stems and inflectional markers.Syntactic Analyzer-The syntactic analyzer will find the syntactic category, like Verbal Phrase, Noun Phrase, and Participle Phrase. This will analyze the sentences in the source text. ",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "annex",
"sec_num": null
}
],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "Language and Machines: Computers in Translation and Linguistics. A report by the Automatic Language Processing Advisory Committee",
"authors": [
{
"first": "Alpac",
"middle": [],
"last": "",
"suffix": ""
}
],
"year": 1966,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "ALPAC. (1966). Language and Machines: Computers in Translation and Linguistics. A report by the Automatic Language Processing Advisory Committee (Tech. Rep. No. Publication 1416), 2101 Constitution Avenue, Washington D.C., 20418 USA: National Academy of Sciences, National Research Council.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "A Hybrid Approach to EBMT for Indian Languages",
"authors": [
{
"first": "V",
"middle": [],
"last": "Ambati",
"suffix": ""
},
{
"first": "U",
"middle": [],
"last": "Rohini",
"suffix": ""
}
],
"year": 2007,
"venue": "ICON",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ambati, V., & Rohini, U. (2007). A Hybrid Approach to EBMT for Indian Languages. ICON 2007.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "Translation Resources, Services and Tools for Indian Languages",
"authors": [
{
"first": "S",
"middle": [],
"last": "Badodekar",
"suffix": ""
}
],
"year": 2003,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Badodekar, S. (2003). Translation Resources, Services and Tools for Indian Languages. Computer Science and Engineering Department, Indian Institute of Technology, Mumbai, 400019, India.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "Multilingual Book Reader: Transliteration, Word-to-Word Translation and Full-text Translation",
"authors": [
{
"first": "P",
"middle": [],
"last": "Balajapally",
"suffix": ""
},
{
"first": "P",
"middle": [],
"last": "Bandaru",
"suffix": ""
},
{
"first": "M",
"middle": [],
"last": "Ganapathiraju",
"suffix": ""
},
{
"first": "N",
"middle": [],
"last": "Balakrishnan",
"suffix": ""
},
{
"first": "R",
"middle": [],
"last": "Reddy",
"suffix": ""
}
],
"year": 2006,
"venue": "VAVA",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Balajapally, P., Bandaru, P., Ganapathiraju, M., Balakrishnan, N., & Reddy, R. (2006). Multilingual Book Reader: Transliteration, Word-to-Word Translation and Full-text Translation. In VAVA 2006.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "ANUSAARAKA: Machine Translation in Stages",
"authors": [
{
"first": "A",
"middle": [],
"last": "Bharati",
"suffix": ""
},
{
"first": "V",
"middle": [],
"last": "Chaitanya",
"suffix": ""
},
{
"first": "A",
"middle": [
"P"
],
"last": "Kulkarni",
"suffix": ""
},
{
"first": "R",
"middle": [],
"last": "Sangal",
"suffix": ""
}
],
"year": 1997,
"venue": "A Quarterly in Artificial Intelligence",
"volume": "10",
"issue": "3",
"pages": "22--25",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Bharati, A., Chaitanya, V., Kulkarni, A. P., & Sangal, R. (1997). ANUSAARAKA: Machine Translation in Stages. A Quarterly in Artificial Intelligence, 10(3), 22-25.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "Towards a Pictorially Grounded Language for Machine-Aided Translation",
"authors": [
{
"first": "S",
"middle": [
"K"
],
"last": "Borgohain",
"suffix": ""
},
{
"first": "S",
"middle": [
"B"
],
"last": "Nair",
"suffix": ""
}
],
"year": 2010,
"venue": "International Journal on Asian Language Processing",
"volume": "20",
"issue": "3",
"pages": "87--109",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Borgohain, S. K., & Nair, S. B. (2010). Towards a Pictorially Grounded Language for Machine-Aided Translation. International Journal on Asian Language Processing, 20 (3), 87-109.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "CALTS in collaboration with, IIIT Hyderabad. English-Telugu T2T Machine Translation and Telugu-Tamil Machine translation System. Indo-German Workshop on Language technologies",
"authors": [],
"year": 2004,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "CALTS in collaboration with, IIIT Hyderabad. English-Telugu T2T Machine Translation and Telugu-Tamil Machine translation System. Indo-German Workshop on Language technologies, AU-KBC Research Centre, Chennai, 2004 . www.au-kbc.org/dfki/igws/Machine_Translation.ppt.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "An English to Indian Sign Language Machine Translation System",
"authors": [
{
"first": "T",
"middle": [],
"last": "Dasgupta",
"suffix": ""
},
{
"first": "A",
"middle": [],
"last": "Basu",
"suffix": ""
}
],
"year": 2008,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Dasgupta, T., & Basu, A. (2008). An English to Indian Sign Language Machine Translation System, www.cse.iitd.ac.in/embedded/assistech/Proceedings/P17.pdf.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "Prototype Machine Translation System From Text-To-Indian Sign Language",
"authors": [
{
"first": "T",
"middle": [],
"last": "Dasgupta",
"suffix": ""
},
{
"first": "S",
"middle": [],
"last": "Dandpat",
"suffix": ""
},
{
"first": "A",
"middle": [],
"last": "Basu",
"suffix": ""
}
],
"year": 2008,
"venue": "Proceedings of the IJCNLP-08 Workshop on NLP for Less Privileged Languages",
"volume": "",
"issue": "",
"pages": "19--26",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Dasgupta, T., Dandpat, S., & Basu, A. (2008). Prototype Machine Translation System From Text-To-Indian Sign Language. In Proceedings of the IJCNLP-08 Workshop on NLP for Less Privileged Languages, 19-26.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "Interlingua-based English-Hindi Machine Translation and Language Divergence",
"authors": [
{
"first": "S",
"middle": [],
"last": "Dave",
"suffix": ""
},
{
"first": "J",
"middle": [],
"last": "Parikh",
"suffix": ""
},
{
"first": "P",
"middle": [],
"last": "Bhattacharya",
"suffix": ""
}
],
"year": 2001,
"venue": "Journal of Machine Translation",
"volume": "16",
"issue": "4",
"pages": "251--304",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Dave, S., Parikh, J., & Bhattacharya, P. (2001). Interlingua-based English-Hindi Machine Translation and Language Divergence. Journal of Machine Translation, 16(4), 251-304.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "Metis II: Example-based machine translation using monolingual corpora -system description",
"authors": [
{
"first": "P",
"middle": [],
"last": "Dirix",
"suffix": ""
},
{
"first": "I",
"middle": [],
"last": "Schuurman",
"suffix": ""
},
{
"first": "V",
"middle": [],
"last": "Vandeghinste",
"suffix": ""
}
],
"year": 2005,
"venue": "Proceedings of the 2nd Workshop on Example-Based Machine Translation",
"volume": "",
"issue": "",
"pages": "43--50",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Dirix, P., Schuurman, I., & Vandeghinste V. (2005). Metis II: Example-based machine translation using monolingual corpora -system description. In Proceedings of the 2nd Workshop on Example-Based Machine Translation, 43-50.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "Statistical post-editing on SYSTRAN's rule-based translation system",
"authors": [
{
"first": "L",
"middle": [],
"last": "Dugast",
"suffix": ""
},
{
"first": "J",
"middle": [],
"last": "Senellart",
"suffix": ""
},
{
"first": "P",
"middle": [],
"last": "Koehn",
"suffix": ""
}
],
"year": 2007,
"venue": "Proceedings of the Second Workshop on SMT",
"volume": "",
"issue": "",
"pages": "220--223",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Dugast, L., Senellart, J., & Koehn, P. (2007). Statistical post-editing on SYSTRAN's rule-based translation system. In Proceedings of the Second Workshop on SMT, 220-223.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "Machine Translation System in Indian Perspectives",
"authors": [
{
"first": "S",
"middle": [
"K"
],
"last": "Dwivedi",
"suffix": ""
},
{
"first": "P",
"middle": [
"P"
],
"last": "Sukhadeve",
"suffix": ""
}
],
"year": 2010,
"venue": "Journal of Computer Science",
"volume": "6",
"issue": "10",
"pages": "1111--1116",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Dwivedi, S. K., & Sukhadeve, P. P. (2010). Machine Translation System in Indian Perspectives. Journal of Computer Science, 6(10), 1111-1116.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "Evaluation of Hindi to Punjabi Machine Translation System",
"authors": [
{
"first": "V",
"middle": [],
"last": "Goyal",
"suffix": ""
},
{
"first": "G",
"middle": [
"S"
],
"last": "Lehal",
"suffix": ""
}
],
"year": 2009,
"venue": "IJCSI International Journal of Computer Science",
"volume": "4",
"issue": "1",
"pages": "36--39",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Goyal, V., & Lehal, G. S. (2009). Evaluation of Hindi to Punjabi Machine Translation System. IJCSI International Journal of Computer Science, 4(1), 36-39.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "Hybrid example-based SMT: the best of both worlds",
"authors": [
{
"first": "D",
"middle": [],
"last": "Groves",
"suffix": ""
},
{
"first": "A",
"middle": [],
"last": "Way",
"suffix": ""
}
],
"year": 2005,
"venue": "Proceedings of the ACL Workshop on Building and Using Parallel Texts",
"volume": "",
"issue": "",
"pages": "183--190",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Groves, D. & Way, A. (2005). Hybrid example-based SMT: the best of both worlds. In Proceedings of the ACL Workshop on Building and Using Parallel Texts, 183-190.",
"links": null
},
"BIBREF15": {
"ref_id": "b15",
"title": "Phrase based English -Tamil Translation System by Concept Labeling using Translation Memory",
"authors": [
{
"first": "R",
"middle": [],
"last": "Harshawardhan",
"suffix": ""
},
{
"first": "M",
"middle": [
"S"
],
"last": "Augustine",
"suffix": ""
},
{
"first": "K",
"middle": [
"P"
],
"last": "Soman",
"suffix": ""
}
],
"year": 2011,
"venue": "International Journal of Computer Applications",
"volume": "20",
"issue": "3",
"pages": "1--6",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Harshawardhan, R., Augustine, M. S., & Soman, K. P. (2011). Phrase based English -Tamil Translation System by Concept Labeling using Translation Memory. International Journal of Computer Applications (0975 -8887), 20(3), 1-6.",
"links": null
},
"BIBREF16": {
"ref_id": "b16",
"title": "The first MT patents",
"authors": [
{
"first": "J",
"middle": [],
"last": "Hutchins",
"suffix": ""
}
],
"year": 1993,
"venue": "MT News International",
"volume": "",
"issue": "",
"pages": "14--15",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Hutchins, J. (1993). The first MT patents. MT News International, 14-15.",
"links": null
},
"BIBREF17": {
"ref_id": "b17",
"title": "The history of machine translation in a nutshell",
"authors": [
{
"first": "J",
"middle": [],
"last": "Hutchins",
"suffix": ""
}
],
"year": 2005,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Hutchins, J. (2005). The history of machine translation in a nutshell. http://www.hutchinsweb.me.uk/Nutshell-2005.pdf.",
"links": null
},
"BIBREF18": {
"ref_id": "b18",
"title": "Petr Petrovich Troyanskii (1854-1950): A forgotten pioneer of mechanical translation. Machine translation",
"authors": [
{
"first": "W",
"middle": [
"J"
],
"last": "Hutchins",
"suffix": ""
},
{
"first": "E",
"middle": [],
"last": "Lovtskii",
"suffix": ""
}
],
"year": 2000,
"venue": "",
"volume": "15",
"issue": "",
"pages": "187--221",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Hutchins, W. J., & Lovtskii, E. (2000). Petr Petrovich Troyanskii (1854-1950): A forgotten pioneer of mechanical translation. Machine translation, 15(3), 187-221.",
"links": null
},
"BIBREF19": {
"ref_id": "b19",
"title": "IBM Archives online: Press release",
"authors": [
{
"first": "",
"middle": [],
"last": "Ibm",
"suffix": ""
}
],
"year": 1954,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "IBM. (1954). 701 Translator. IBM Archives online: Press release January 8th 1954, http://www-03.ibm.com/ibm/history/exhibits/701/701-translator.html.",
"links": null
},
"BIBREF20": {
"ref_id": "b20",
"title": "Design and Development of an Adaptable Frame-based System for Dravidian Language",
"authors": [
{
"first": "S",
"middle": [
"M"
],
"last": "Idicula",
"suffix": ""
}
],
"year": 1999,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Idicula, S. M. (1999). Design and Development of an Adaptable Frame-based System for Dravidian Language. Ph.D thesis, Department of Computer Science, COCHIN University of Science and Technology.",
"links": null
},
"BIBREF21": {
"ref_id": "b21",
"title": "Machine Aided Translation Systems: The Indian Scenario",
"authors": [
{
"first": "A",
"middle": [],
"last": "Jain",
"suffix": ""
}
],
"year": 2009,
"venue": "",
"volume": "2",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Jain, A. (2009). Machine Aided Translation Systems: The Indian Scenario. 2(6), 2009. www.iitk.ac.in/infocell/Archive/dirnov2/ techno_machine.html.",
"links": null
},
"BIBREF22": {
"ref_id": "b22",
"title": "Factored translation models",
"authors": [
{
"first": "P",
"middle": [],
"last": "Koehn",
"suffix": ""
},
{
"first": "H",
"middle": [],
"last": "Hoang",
"suffix": ""
}
],
"year": 2007,
"venue": "Proceedings of the 2007 Joint Conference on Empirical Methods. In NLP and Computational Natural Language Learning",
"volume": "",
"issue": "",
"pages": "868--876",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Koehn, P. & Hoang, H. (2007). Factored translation models. In Proceedings of the 2007 Joint Conference on Empirical Methods. In NLP and Computational Natural Language Learning, 868-876.",
"links": null
},
"BIBREF23": {
"ref_id": "b23",
"title": "Developing English-Urdu Machine Translation Via Hindi",
"authors": [
{
"first": "R",
"middle": [],
"last": "Mahesh",
"suffix": ""
},
{
"first": "K",
"middle": [],
"last": "Sinha",
"suffix": ""
}
],
"year": 2009,
"venue": "Third Workshop on Computational Approaches to Arabic Scriptbased Languages (CAASL3)",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Mahesh, R., & Sinha, K. (2009). Developing English-Urdu Machine Translation Via Hindi. In Third Workshop on Computational Approaches to Arabic Scriptbased Languages (CAASL3), MT Summit XII, Ottawa, Canada.",
"links": null
},
"BIBREF24": {
"ref_id": "b24",
"title": "Foundations of Statistical NLP",
"authors": [
{
"first": "C",
"middle": [],
"last": "Manning",
"suffix": ""
},
{
"first": "H",
"middle": [],
"last": "Schutze",
"suffix": ""
}
],
"year": 2003,
"venue": "Proceedings of HLT/NAACL",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Manning, C., & Schutze, H. (2003). Foundations of Statistical NLP. Proceedings of HLT/NAACL.",
"links": null
},
"BIBREF25": {
"ref_id": "b25",
"title": "Sanskrit Karaka Analyzer for Machine Translation",
"authors": [
{
"first": "S",
"middle": [
"K"
],
"last": "Mishra",
"suffix": ""
}
],
"year": 2007,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Mishra, S. K. (2007). Sanskrit Karaka Analyzer for Machine Translation. PhD. Thesis, Jawaharlal Nehru University.",
"links": null
},
"BIBREF26": {
"ref_id": "b26",
"title": "SMT using Joshua: An approach to build 'enTel' system. Language in India, Special Volume:Problems of Parsing in Indian Languages",
"authors": [
{
"first": "A",
"middle": [],
"last": "Nalluri",
"suffix": ""
},
{
"first": "V",
"middle": [],
"last": "Kommaluri",
"suffix": ""
}
],
"year": 2011,
"venue": "",
"volume": "11",
"issue": "",
"pages": "1--6",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Nalluri, A., & Kommaluri, V. (2011). SMT using Joshua: An approach to build 'enTel' system. Language in India, Special Volume:Problems of Parsing in Indian Languages, 11(5), 1-6. www.languageinindia.com.",
"links": null
},
"BIBREF27": {
"ref_id": "b27",
"title": "Use of Machine Translation in India: Current Status",
"authors": [
{
"first": "S",
"middle": [],
"last": "Naskar",
"suffix": ""
},
{
"first": "S",
"middle": [],
"last": "Bandyopadhyay",
"suffix": ""
}
],
"year": 2005,
"venue": "Proceedings of MT SUMMIT X",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Naskar, S., & Bandyopadhyay, S. (2005). Use of Machine Translation in India: Current Status. In Proceedings of MT SUMMIT X; September 13-15, 2005, Phuket, Thailand.",
"links": null
},
"BIBREF28": {
"ref_id": "b28",
"title": "Machine Translation -A Transfer Approach, A project report",
"authors": [
{
"first": "G",
"middle": [],
"last": "Noone",
"suffix": ""
}
],
"year": 2003,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Noone, G. (2003). Machine Translation -A Transfer Approach, A project report, www.scss.tcd.ie/undergraduate/bacsll/bacsll_web/nooneg0203.pdf.",
"links": null
},
"BIBREF29": {
"ref_id": "b29",
"title": "Towards hybrid quality-oriented machine translation on linguistics and probabilities in MT",
"authors": [
{
"first": "S",
"middle": [],
"last": "Oepen",
"suffix": ""
},
{
"first": "E",
"middle": [],
"last": "Velldal",
"suffix": ""
},
{
"first": "J",
"middle": [
"T"
],
"last": "L\u00f8nning",
"suffix": ""
},
{
"first": "P",
"middle": [],
"last": "Meurer",
"suffix": ""
},
{
"first": "V",
"middle": [],
"last": "Rosen",
"suffix": ""
},
{
"first": "D",
"middle": [],
"last": "Flickinger",
"suffix": ""
}
],
"year": 2007,
"venue": "Proceedings of the 11th Conference on Theoretical and Methodological Issues in Machine Translation",
"volume": "",
"issue": "",
"pages": "144--153",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Oepen, S., Velldal, E., L\u00f8nning, J. T., Meurer, P., Rosen, V., & Flickinger, D. (2007). Towards hybrid quality-oriented machine translation on linguistics and probabilities in MT. In Proceedings of the 11th Conference on Theoretical and Methodological Issues in Machine Translation, 144-153.",
"links": null
},
"BIBREF30": {
"ref_id": "b30",
"title": "Rule-based Sentence Simplification for English to Tamil Machine Translation System",
"authors": [
{
"first": "C",
"middle": [],
"last": "Poornima",
"suffix": ""
},
{
"first": "V",
"middle": [],
"last": "Dhanalakshmi",
"suffix": ""
},
{
"first": "M",
"middle": [
"A"
],
"last": "Kumar",
"suffix": ""
},
{
"first": "K",
"middle": [
"P"
],
"last": "Soman",
"suffix": ""
}
],
"year": 2011,
"venue": "International Journal of Computer Applications",
"volume": "",
"issue": "8",
"pages": "38--42",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Poornima, C., Dhanalakshmi, V., Kumar M. A., & Soman, K. P. (2011). Rule-based Sentence Simplification for English to Tamil Machine Translation System. International Journal of Computer Applications (0975 -8887), 25(8), 38-42.",
"links": null
},
"BIBREF31": {
"ref_id": "b31",
"title": "Rule-based Reordering and Morphological Processing For English-Malayalam SMT",
"authors": [
{
"first": "C",
"middle": [],
"last": "Rahul",
"suffix": ""
},
{
"first": "K",
"middle": [],
"last": "Dinunath",
"suffix": ""
},
{
"first": "R",
"middle": [],
"last": "Ravindran",
"suffix": ""
},
{
"first": "K",
"middle": [
"P"
],
"last": "Soman",
"suffix": ""
}
],
"year": 2009,
"venue": "International Conference on Advances in Computing, Control, and Telecommunication Technologies",
"volume": "",
"issue": "",
"pages": "458--460",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Rahul, C., Dinunath, K., Ravindran, R., & Soman, K. P. (2009). Rule-based Reordering and Morphological Processing For English-Malayalam SMT. International Conference on Advances in Computing, Control, and Telecommunication Technologies, 458-460.",
"links": null
},
"BIBREF32": {
"ref_id": "b32",
"title": "Simple Syntactic and Morphological Processing Can Help English-Hindi SMT",
"authors": [
{
"first": "A",
"middle": [],
"last": "Ramanathan",
"suffix": ""
},
{
"first": "P",
"middle": [],
"last": "Bhattacharyya",
"suffix": ""
},
{
"first": "J",
"middle": [],
"last": "Hegde",
"suffix": ""
},
{
"first": "R",
"middle": [
"M"
],
"last": "Shah",
"suffix": ""
},
{
"first": "M",
"middle": [],
"last": "Sasikumar",
"suffix": ""
}
],
"year": 2008,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ramanathan, A., Bhattacharyya, P., Hegde, J., Shah, R. M., & Sasikumar, M. (2008). Simple Syntactic and Morphological Processing Can Help English-Hindi SMT. In IJCNLP 2008.",
"links": null
},
"BIBREF33": {
"ref_id": "b33",
"title": "Machine Translation in India: A Brief Survey",
"authors": [
{
"first": "M",
"middle": [
"D"
],
"last": "Rao",
"suffix": ""
}
],
"year": 2000,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Rao, M. D. (2000). Machine Translation in India: A Brief Survey. www.elda.org/en/proj/scalla/SCALLA2001/SCALLA2001Rao.pdf.",
"links": null
},
"BIBREF34": {
"ref_id": "b34",
"title": "An Interactive Approach to Development of English-Tamil Machine Translation System on the Web",
"authors": [
{
"first": "V",
"middle": [],
"last": "Renganathan",
"suffix": ""
}
],
"year": 2002,
"venue": "Tamil Internet",
"volume": "",
"issue": "",
"pages": "68--73",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Renganathan, V. (2002). An Interactive Approach to Development of English-Tamil Machine Translation System on the Web. Tamil Internet 2002, California, USA. 68-73. www.infitt.org/ti2002/hubs/ conference/papers.html.",
"links": null
},
"BIBREF35": {
"ref_id": "b35",
"title": "Rule-based translation with statistical phrase-based post-editing",
"authors": [
{
"first": "M",
"middle": [],
"last": "Simard",
"suffix": ""
},
{
"first": "N",
"middle": [],
"last": "Ueffing",
"suffix": ""
},
{
"first": "P",
"middle": [],
"last": "Isabelle",
"suffix": ""
},
{
"first": "R",
"middle": [],
"last": "Kuhn",
"suffix": ""
}
],
"year": 2007,
"venue": "Proceedings of the Second Workshop on SMT",
"volume": "",
"issue": "",
"pages": "203--206",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Simard, M., Ueffing, N., Isabelle, P., & Kuhn, R. (2007). Rule-based translation with statistical phrase-based post-editing. In Proceedings of the Second Workshop on SMT, 203-206.",
"links": null
},
"BIBREF36": {
"ref_id": "b36",
"title": "Manipuri-English Bidirectional SMT Systems using Morphology and Dependency Relations",
"authors": [
{
"first": "T",
"middle": [
"D"
],
"last": "Singh",
"suffix": ""
},
{
"first": "S",
"middle": [],
"last": "Bandyopadhyay",
"suffix": ""
}
],
"year": 2010,
"venue": "Proceedings of SSST-4, Fourth Workshop on Syntax and Structure in Statistical Translation",
"volume": "",
"issue": "",
"pages": "83--91",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Singh, T. D., & Bandyopadhyay, S. (2010). Manipuri-English Bidirectional SMT Systems using Morphology and Dependency Relations. In Proceedings of SSST-4, Fourth Workshop on Syntax and Structure in Statistical Translation, 83-91, COLING 2010, Beijing.",
"links": null
},
"BIBREF37": {
"ref_id": "b37",
"title": "AnglaHindi: An English to Hindi Machine-Aided Translation System",
"authors": [
{
"first": "R",
"middle": [
"M K"
],
"last": "Sinha",
"suffix": ""
},
{
"first": "A",
"middle": [],
"last": "Jain",
"suffix": ""
}
],
"year": 2003,
"venue": "MT Summit IX",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Sinha, R. M. K. & Jain, A. (2003). AnglaHindi: An English to Hindi Machine-Aided Translation System. In MT Summit IX, New Orleans, Louisiana, USA, September, 2003.",
"links": null
},
"BIBREF38": {
"ref_id": "b38",
"title": "ANGLABHARTI: a multilingual machine aided translation project on translation from English to Indian languages",
"authors": [
{
"first": "R",
"middle": [
"M K"
],
"last": "Sinha",
"suffix": ""
},
{
"first": "K",
"middle": [],
"last": "Sivaraman",
"suffix": ""
},
{
"first": "A",
"middle": [],
"last": "Agrawal",
"suffix": ""
},
{
"first": "R",
"middle": [],
"last": "Jain",
"suffix": ""
},
{
"first": "R",
"middle": [],
"last": "Srivastava",
"suffix": ""
},
{
"first": "A",
"middle": [],
"last": "Jain",
"suffix": ""
}
],
"year": 1995,
"venue": "IEEE International Conference on: Systems, Man and Cybernetics",
"volume": "",
"issue": "",
"pages": "1609--1614",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Sinha, R. M. K., Sivaraman, K., Agrawal, A., Jain, R., Srivastava, R. & Jain, A. (1995). ANGLABHARTI: a multilingual machine aided translation project on translation from English to Indian languages. IEEE International Conference on: Systems, Man and Cybernetics, 1995. Intelligent Systems for the 21st Century, 1609-1614.",
"links": null
},
"BIBREF39": {
"ref_id": "b39",
"title": "A Novel Approach for English to South Dravidian Language SMT System",
"authors": [
{
"first": "P",
"middle": [],
"last": "Unnikrishnan",
"suffix": ""
},
{
"first": "P",
"middle": [
"J"
],
"last": "Antony",
"suffix": ""
},
{
"first": "K",
"middle": [
"P"
],
"last": "Soman",
"suffix": ""
}
],
"year": 2010,
"venue": "International Journal on Computer Science and Engineering (IJCSE)",
"volume": "",
"issue": "08",
"pages": "2749--2759",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Unnikrishnan, P., Antony, P. J., & Soman, K. P. (2010). A Novel Approach for English to South Dravidian Language SMT System. International Journal on Computer Science and Engineering (IJCSE), 02(08), 2749-2759.",
"links": null
},
"BIBREF40": {
"ref_id": "b40",
"title": "Vaasaanubaada Automatic Machine Translation Of Bilingual Bengali -Assamese News Texts",
"authors": [
{
"first": "K",
"middle": [],
"last": "Vijayanand",
"suffix": ""
},
{
"first": "S",
"middle": [],
"last": "Choudhury",
"suffix": ""
},
{
"first": "P",
"middle": [],
"last": "Ratna",
"suffix": ""
}
],
"year": 2002,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Vijayanand, K., Choudhury, S., & Ratna, P. (2002). Vaasaanubaada Automatic Machine Translation Of Bilingual Bengali -Assamese News Texts. Language Engineering Conference, University of Hyderabad, India.",
"links": null
},
"BIBREF41": {
"ref_id": "b41",
"title": "Warren Weaver Memorandum",
"authors": [
{
"first": "W",
"middle": [],
"last": "Weaver",
"suffix": ""
}
],
"year": 1949,
"venue": "MT News International",
"volume": "",
"issue": "22",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Weaver, W. (1999). Warren Weaver Memorandum, July 1949. MT News International, no. 22, July 1999, 5-6, 15.",
"links": null
},
"BIBREF42": {
"ref_id": "b42",
"title": "A SMT Approach to Sinhala-Tamil Language Translation",
"authors": [
{
"first": "R",
"middle": [],
"last": "Weerasinghe",
"suffix": ""
}
],
"year": 2011,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Weerasinghe, R. (2011). A SMT Approach to Sinhala-Tamil Language Translation. citeseerx.ist.psu.edu /viewdoc/summary?doi= 10.1.1.78.7481, 2011.",
"links": null
},
"BIBREF43": {
"ref_id": "b43",
"title": "Chinese-English SMT by Parsing",
"authors": [
{
"first": "Y",
"middle": [],
"last": "Zhang",
"suffix": ""
}
],
"year": 2006,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Zhang, Y. (2006). Chinese-English SMT by Parsing. www.cl.cam.ac.uk/~yz360/ mscthesis.pdf.",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"num": null,
"uris": null,
"type_str": "figure",
"text": "Figure 2shows the classification of MT in Natural language Processing (NLP). Classification of MT System."
},
"FIGREF1": {
"num": null,
"uris": null,
"type_str": "figure",
"text": "The main intention of this bifurcation is to develop Machine Aided Translation (MAT) systems for English to twelve Indian regional languages. These include MT from English to Marathi & Konkani (IIT, Mumbai): English to Asamiya and Manipuri (IIT, Guwahati): English to Bangla (CDAC, Kolkata): English to Urdu, Sindhi & Kashmiri (CDAC-GIST group, Pune): English to Malyalam (CDAC, Thiruvananthpuram): English to Punjabi (Thapar Institute of Engineering and Technology-TIET, Patiala) English to Sanskrit (Jawaharlal Nehru University -JNU, New Delhi): and English to Oriya (Utkal University, Bhuvaneshwar)."
},
"TABREF1": {
"text": "Translation Studies (CALTS), Department of Humanities and Social Sciences, University of Hyderabad. At present, the Language Technology Research Centre (LTRC) at IIIT Hyderabad is developing an English to Hindi MT system using the architecture of the Anusaaraka approach. This Anusaaraka project is being developed under the supervision of Prof. Rajeev Sangal and Prof. G U Rao.",
"content": "<table/>",
"type_str": "table",
"html": null,
"num": null
}
}
}
} |